class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if (n <= 2) return n;
        int pre = 0, cur = 1, count = 1;
        while (cur < n) {
            if (A[pre] == A[cur] && count == 0) ++cur;
            else {
                if (A[pre] == A[cur]) --count;
                else count = 1;
                A[++pre] = A[cur++];
            }
        }
        return pre + 1;
    }
};

相关文章:

  • 2021-10-04
  • 2021-07-16
  • 2022-12-23
  • 2022-02-24
猜你喜欢
  • 2022-12-23
  • 2022-01-09
  • 2021-12-24
  • 2021-07-24
  • 2021-11-17
  • 2022-03-04
相关资源
相似解决方案