LeetCode之移除已排序數組中的相同元素

描述：
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].
注：
本例子代碼都將在VS中編譯通過；

#include<vector>
#include<iostream>

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;
    }
};

int main(int argc, char** argv) {

    Solution test;
    vector<int> test_;
    test_.push_back(1);
    test_.push_back(1);
    test_.push_back(3);
    test_.push_back(6);
    test_.push_back(6);
    test_.push_back(6);
    test_.push_back(9);
    test_.push_back(11);
    cout<<"Src:"<<test_.size()<<endl<<"New:"<<test.removeDuplicates(test_)<<endl;
    system("pause");
    return 0;
}

運行結果如下所示;