80. Remove Duplicates from Sorted Array II 

1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
    public int removeDuplicates(int[] nums) {
        int i = 0; // 指向即将写入数据的索引
        for (int num : nums) {
            if (i - 2 < 0 || num != nums[i - 2]) {
                nums[i++] = num;
            }
        }

        return i; // 返回去重子数组的长度
    }
}

References

80. Remove Duplicates from Sorted Array II