[Swift]LeetCode80. 删除排序数组中的重复项 II | Remove Duplicates from Sorted Array II

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9935071.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twiceand return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:

Given nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,1,2,3,3],

Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.

It doesn't matter what values are set beyond the returned length.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

---

给定一个排序数组，你需要在原地删除重复出现的元素，使得每个元素最多出现两次，返回移除后数组的新长度。

不要使用额外的数组空间，你必须在原地修改输入数组并在使用 O(1) 额外空间的条件下完成。

示例 1:

给定 nums = [1,1,1,2,2,3],

函数应返回新长度 length = 5, 并且原数组的前五个元素被修改为 1, 1, 2, 2, 3 。

你不需要考虑数组中超出新长度后面的元素。

示例 2:

给定 nums = [0,0,1,1,1,1,2,3,3],

函数应返回新长度 length = 7, 并且原数组的前五个元素被修改为 0, 0, 1, 1, 2, 3, 3 。

你不需要考虑数组中超出新长度后面的元素。

说明:

为什么返回数值是整数，但输出的答案是数组呢?

请注意，输入数组是以“引用”方式传递的，这意味着在函数里修改输入数组对于调用者是可见的。

你可以想象内部操作如下:

// nums 是以“引用”方式传递的。也就是说，不对实参做任何拷贝
int len = removeDuplicates(nums);

// 在函数里修改输入数组对于调用者是可见的。
// 根据你的函数返回的长度, 它会打印出数组中该长度范围内的所有元素。
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

---

12ms

class Solution {
    func removeDuplicates(_ nums: inout [Int]) -> Int {
        if nums.count == 0 { return 0 }
        var result = 0
        
        var j = 1
        var repeatCount = 0
        var pre = nums[0]
        for i in 1..<nums.count {
            if nums[i] == pre {
                repeatCount += 1
                if repeatCount <= 1 {
                    nums[j] = nums[i]
                    j += 1
                }
            } else {
                pre = nums[i]
                repeatCount = 0
                nums[j] = nums[i]
                j += 1
            }
        }
        return j
    }
}

---

16ms

class Solution {
    func removeDuplicates(_ nums: inout [Int]) -> Int {
        guard !nums.isEmpty else {return 0}
        var ip = 0, currCount = 1
        for jp in 1..<nums.count {
            if nums[ip] == nums[jp] {
                currCount += 1
            } else {
                currCount = 1
            }
            if currCount <= 2 {
                ip += 1
                (nums[ip], nums[jp]) = (nums[jp], nums[ip])
            }
        }
        return ip + 1
    }
}

---

40ms

class Solution {
    func removeDuplicates(_ nums: inout [Int]) -> Int {
        var i = 0
        for num in nums {
            if i < 2 || num > nums[i-2] {
                nums[i] = num
                i += 1
            }
        }
        nums[i...] = []
        return i
    }
}

---

44ms

class Solution {
    func removeDuplicates(_ nums: inout [Int]) -> Int {
        guard nums.count > 0 else {
            return 0
        }
        var position = 1 // [0..<position]: result array
        var pre = nums[0] // previous value to compare with
        var repeatCount = 0
        for i in 1 ..< nums.count {
            if nums[i] == pre {
                repeatCount += 1
                if repeatCount <= 1 {
                    // repeat count less than 2, put the value into the result position
                    nums[position] = nums[i]
                    position += 1
                }
            } else {
                repeatCount = 0
                // not equal to previous value, put it into the result position
                pre = nums[i]
                nums[position] = nums[i]
                position += 1
            }
        }
        nums[position...] = []
        return position
    }
}