[Leetcode] Remove Duplicates from Sorted Arrary II

最新推荐文章于 2020-02-05 22:10:04 发布

原创最新推荐文章于 2020-02-05 22:10:04 发布 · 209 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

67 篇文章

订阅专栏

本文探讨了如何在已排序的数组中移除最多出现两次的重复元素，通过实现一个高效的算法，确保数组长度减小，同时保留不超过两次的重复元素。

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

善用返回值！

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int lastInt = A[0]-1;
        int lastIntTime = 0;
        int length = 0;
        
        for(int i=0;i<n;i++)
        {
            if(A[i]==lastInt)
            {
                lastIntTime ++;
            }
            else
            {
                lastIntTime = 1;
            }
            
            lastInt = A[i];
            
            if(lastIntTime<3)
            {
                length++;                
                A[length-1] = A[i];
            }  
        }
        return length;
    }
    
};

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].