leetcode_Remove Duplicates from Sorted Array II

最新推荐文章于 2025-09-12 18:45:12 发布

weixin_30357231

最新推荐文章于 2025-09-12 18:45:12 发布

阅读量44

点赞数

CC 4.0 BY-SA版权

文章标签： c/c++

原文链接：http://www.cnblogs.com/graph/archive/2013/04/28/3048898.html

本文介绍了一个C++实现的数组去重算法，该算法允许每个元素最多出现两次，并返回修改后的数组长度及更新后的数组内容。

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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
         if(n<2) return n;
        int value,count =1;
        value = A[0];
        int length = 0;
        for(int i = 1;i<n;i++)
        {
           if(A[i] == value){
                count++;
                if(count >2)
                   length++;
                 else if(length >0)
                    A[i-length] = A[i];                  
           }else{
           
                value = A[i];
                count = 1;
                if(length >0)
                  A[i-length] = A[i];    
           }
        }
        return n-length ;
    }
};