删除有序数组中的重复项

#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
    int removeDuplicates(vector<int>& nums)
    {
        int num = nums.size();//计算删除重复元素数组中的元素个数
        int j = 0;
        for (int i = 0; i < nums.size()-1; i++)
        {
            j = i + 1;
            while (nums[i] == nums[j])
            {
                for (; j+1< nums.size(); j++)
                {
                    nums[j] = nums[j + 1];
                }
                vector<int>::iterator it = nums.begin() + j;
                nums.erase(it);
                num--;
                j=i+1;
            }
        }

        return num;
    }
};
void test()
{
    vector<int> arr = { 1,1,2 };
    Solution s;
    int num=s.removeDuplicates(arr);
    cout << "数组元素个数为：" << num << endl;
    for (int i = 0; i < num; i++)
    {
        cout << arr[i];
    }
    cout << endl;
}
int main()
{
    test();
    system("pause");
    return 0;
}

  int removeDuplicates(vector<int>&nums) {
            if (nums.size() < 2) return nums.size();
            int j = 0;
            for (int i = 1; i < nums.size(); i++)
                if (nums[j] != nums[i]) nums[++j] = nums[i];
            return ++j;
        }