LEETCODE: Remove Duplicates from Sorted Array II

停止更新+1

于 2014-12-26 21:15:03 发布

阅读量233

点赞数

CC 4.0 BY-SA版权

文章标签： LEETCODE 算法数组

本文链接：https://blog.youkuaiyun.com/anyicheng2015/article/details/42177303

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一个数组去重的算法实现，允许元素重复出现两次。通过遍历数组并计数，将超过两次的重复元素移除，最终返回处理后的数组长度及内容。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array A = [1,1,1,2,2,3],

Your function should return length = 5, and A is now [1,1,2,2,3].

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        int newlength = n;
        for(int ii = n - 1; ii >= 0; ii --) {
            int current = A[ii];
            //Search to left
            int count = 1;
            while(ii - count >= 0 && A[ii - count] == current) {
                count ++;
            }
            
            if(count > 2) {
                newlength -= count - 2;
                for(int jj = ii - count + 2; jj < newlength; jj ++) {
                    A[jj] = A[jj + count - 2];
                }
                ii -= count - 2;
            }
        }
        return newlength;
    }
};