【leetcode】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

本题在leetcode中属于esay的级别，也确实不难。

遍历list，用两个变量记录当前位置和下一位置的值，如果两个值相等，删掉下一位置元素，不相等就两个变量均往后移一位。

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 0:
            return 0
        elif len(nums) == 1:
            return 1

        current = 0
        next = 1
        while True:
            if next >= len(nums):
                break
            if nums[current] == nums[next]:
                nums.pop(next)
            else:
                temp = next
                next = next + 1
                current = temp
        return len(nums)

【leetcode】Remove Duplicates from Sorted Array

原文：http://www.cnblogs.com/seyjs/p/5222882.html