LeetCodeDiary

A Diary for solving LeetCode problems

View on GitHub
class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        j = 2
        for i in range(2, len(nums)):
            if nums[i] != nums[j - 2]:
                nums[j] = nums[i]
                j += 1
        return j

数组 中等 每日一题

https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii/