leetcode-26-Remove Duplicates from Sorted Array

题目：Given a sorted array, 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 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 of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.

题目大意：
1.去掉一个有序list中重复的部分
2.不能使用额外的空间，使用连续的空间
3.返回类型是int。将不重复的元素仍然保存在nums的前面若干个位置。除了这前若干个剩下的元素是什么没关系。

PYTHON 100ms AC。

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        k=len(nums)
        if k==0: 
            return None
        p=0
        for i in range(k):
           if nums[i]!=nums[p]:
               p+=1
               nums[p]=nums[i]
        return p+1

思路：遍历的同时维护一个p指向当前的新的length的末尾，遇到与当前p指向的元素不同时，存入p的下一个，p指针移位。