0026.remove-duplicates-from-sorted-array

from typing import List
import operator

#--------testcase input---------
nums1 = [0,0,1,1,1,2,2,3,3,4]
nums2 = [1]
nums3 = [1,1]
nums4 = [1,2]
nums5 = [1,1,2,3]


#----------------------------main function--------------------------------
# V1.0 不太优雅的快慢指针
# def removeDuplicates(nums: List[int]) -> int:
#     p = nums
#     i = 0
#     j = 1
#     length = len(nums)
#     cnt = 1
#     while length > 1:
#         if p[i] == p[j]:
#             while p[i] >= p[j]:
#                 j += 1
#                 if j == length:
#                     return cnt
#             cnt += 1
#             p[i+1] = p[j]
#         else:
#             cnt += 1
#             p[i+1] = p[j]
#         j += 1
#         i += 1
#         if j == length:
#             return cnt  
#     return cnt

# V1.1:快慢指针
#时间复杂度：O(n)
#空间复杂度：O(1)
'''
解题思路：
1.开始时这两个指针都指向第一个数字
2.如果两个指针指的数字相同，则快指针向前走一步
3.如果不同，则两个指针都向前走一步
4.当快指针走完整个数组后，慢指针当前的坐标加 1 就是数组中不同数字的个数
'''
def removeDuplicates(nums: List[int]) -> int:
    if nums:
        slow = 0
        for fast in range(1,len(nums)):  #for i in range(0,n)相当于int i=0; if(i<n) {do; i++;}如此既包括了指针向前走，也避免了为 考虑nums长度为0、考虑nums长度为1、fast不可越界 而增加判断代码
            if nums[slow] != nums[fast]: #注意当相等时，不可fast+=1，for循环已经包括自增了
                nums[slow+1] = nums[fast]
                slow += 1
        return slow+1
    else:
        return 0


#--------testcase output---------
if not removeDuplicates(nums1) == 5:
    print('error1')
if operator.ne(nums1[:5],[0,1,2,3,4]):
    print('error1')
if not removeDuplicates(nums2) == 1:
    print('error2')
if operator.ne(nums2,[1]):
    print('error2')
if not removeDuplicates(nums3) == 1:
    print('error3')
if operator.ne(nums3[:1],[1]):
    print('error3')
if not removeDuplicates(nums4) == 2:
    print('error4')
if operator.ne(nums4,[1,2]):
    print('error4')
if not removeDuplicates(nums5) == 3:
    print('error5')
if operator.ne(nums5[:3],[1,2,3]):
    print('error5')