class Solution:
    def removeDuplicates(self, nums):
        if len(nums) == 0:
            return 0
        i = 0
        for j in range(1,len(nums)):
            if nums[j] != nums[i]:
                i+=1
                nums[i] = nums[j]
        del nums[i+1:]
        return i+1

 本题加强版:

Leetcode 80

相关文章:

  • 2021-12-25
  • 2021-09-06
  • 2021-10-18
  • 2021-06-22
  • 2022-12-23
猜你喜欢
  • 2022-01-17
  • 2021-11-04
  • 2021-10-24
  • 2021-06-18
  • 2021-06-20
  • 2021-08-10
  • 2021-07-27
相关资源
相似解决方案