80. 删除有序数组中的重复项 II

原题

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

思路

双指针

复杂度

时间：O(n)
空间：O(n)

Python代码

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        if len(nums) <= 2:
            return len(nums)
        l = 2
        for r in range(2, len(nums)):
            if nums[r] != nums[l-2]:
                nums[l] = nums[r]
                l += 1 
        return l
       

Go代码

func removeDuplicates(nums []int) int {
	if len(nums) <= 2 {
		return len(nums)
	}
	l := 2
	for r := 2; r < len(nums); r++ {
		if nums[r] != nums[l-2] {
			nums[l] = nums[r]
			l++
		}
	}
	return l
}