[LeetCode] Remove Duplicates from Sorted Array II

 1 #include <iostream>
 2 using namespace std;
 3 
 4 class Solution {
 5 public:
 6     int removeDuplicates(int A[], int n) {
 7         if(n<3) return n;
 8 //        cout<<n<<endl;
 9         int retidx= 1,curidx =2;
10         for(;curidx<n;curidx++){
11 //            cout<<retidx<<" "<<curidx<<endl;
12             if(A[retidx]==A[curidx]&&A[retidx-1]==A[curidx])
13                 continue;
14             A[++retidx] = A[curidx];
15         }
16         return retidx+1;
17     }
18 };
19 
20 int main()
21 {
22     int a[]={};
23     Solution sol;
24     int ret = sol.removeDuplicates(a,sizeof(a)/sizeof(int));
25     for(int i=0;i<ret;i++)
26         cout<<a[i]<<" ";
27     cout<<endl;
28     return 0;
29 }