题目：
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 def removeDuplicates(self, nums): 2 numslen = len(nums) 3 if numslen == 0: 4 return 0 5 elif numslen == 1: 6 return 1 7 else: 8 i = 0 9 j = 1 10 while j < numslen: 11 if nums[i] == nums[j]: 12 nums.remove(nums[i]) 13 numslen = numslen - 1 14 continue 15 else: 16 i = i + 1 17 j = j + 1 18 continue 19 20 return numslen
Remove Duplicates from Sorted Array 自己代码
原文：http://www.cnblogs.com/tingyu-yudeyinji/p/4733724.html