26. Remove Duplicates from Sorted Array

Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
Example 1:

Given nums =[1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.

It doesn’t matter what you leave beyond the returned length.

Example 2:

Given nums =[0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4respectively.

It doesn’t matter what values are set beyond the returned length.
初看题目，一般都会想出一个O(n^2)的方法，就是扫描全数组，每个元素和后一个元素比价，然后移动后面的元素到前面。

这样提交直接就TLE

//88ms
class Solution {
public:
    int removeDuplicates(int A[], int n) {
        for(int i=0;i<n-1;i++){
            if(A[i]==A[i+1]){
                for(int j=i+1;j<n-1;j++)
                    A[j]=A[j+1];
                n--;
                i--;
            }
        }
        return n;
    }
};

后来看的Leetcode官网的答案。

class Solution:
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        if n < 2:
            return n
        lenth = 1
        for i in range(1, n):
            if nums[i] != nums[i - 1]:
                nums[lenth] = nums[i]
                lenth += 1
        return lenth