leetcode之Remove Duplicates from Sorted Array 问题

问题描述：

Given a sorted array（注意题目给的是已经排好序的数组）, remove the duplicates in place such that each element appear onlyonce and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements ofnums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

示例：

就是上面给的数组nums = [1, 1, 2]，最后返回的数组长度为2，因为有两个重复的1。其他的也没啥好说的，很容易理解。另外，题目要求空间复杂度为O(1)

思路：由于题目给定的数组是已经排好序的数组，采用i来计数，我们只需要判断当前的数字是不是大于它前面的数字，大于它的话就覆盖前面重复的数值，小于等于的话则继续遍历数组的下一个元素。

问题来源：Remove Duplicates from Sorted Array (具体链接：https://leetcode.com/problems/remove-duplicates-from-sorted-array/#/description)

代码：