刷题

刷题

/*  Title description:

Given a sorted array, remove the duplicates in place such that each element appear only once
and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example, Given input array A = [1,1,2],
Your function should return length = 2, and A is now [1,2].

*/

#include <stdio.h>
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;

class solution_1{
public:
    int removeDuplicate(vector<int>& ary){
        int index=0;
        for(int i = 0; i < ary.size(); i++){
            if(ary[index] != ary[i]){
                ary[++index] = ary[i];
            }
        }
        return index+1;
    }
};
class solution_2{
public:
    int removeDuplicate(vector<int>& ary){
        return distance(ary.begin(),unique(ary.begin(),ary.end()));
    }
};

int  main()
{
    vector<int> vt  = {1,3,6,7,7,7,8,11};
    solution_1 s1;
    solution_2 s2;
    cout << "The first answer of solution is: " << s1.removeDuplicate(vt) << endl;
     for( int i = 0; i < vt.size(); i++){
        cout << vt[i] << endl;
    }
    cout << "The second answer of solution is: " << s2.removeDuplicate(vt) << endl;
    for( int i = 0; i < vt.size(); i++){
        cout << vt[i] << endl;
    }
    

}

/*  Title description:

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]

*/

#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.empty()) return 0;
        int index = 0;
        for (int i = 1; i < nums.size(); i++) {
        if (nums[index] != nums[i])
        nums[++index] = nums[i];
        }
return index + 1;
    }
};