题目:

题解:
func removeDuplicates(nums []int) int {
n := len(nums)
if n <= 2 {
return n
}
slow, fast := 2, 2
for fast < n {
if nums[slow-2] != nums[fast] {
nums[slow] = nums[fast]
slow++
}
fast++
}
return slow
}













![[Kubernetes] kube-proxy 详解](https://img-blog.csdnimg.cn/direct/11df666a203c4345aab9e4d6f1eac3a6.png)



