[LeetCode]题解（python）：026RemoveDuplicatesfromSortedArray

 1 class Solution(object):
 2     def removeDuplicates(self, nums):
 3         """
 4         :type nums: List[int]
 5         :rtype: int
 6         """
 7         i = 1
 8         j = 1
 9         size = len(nums)
10         while j < size:
11             if nums[j] == nums[i - 1]:
12                 j += 1
13             else:
14                 nums[i] = nums[j]
15                 i += 1
16                 j += 1
17         return min(i,size)