RemoveDuplicatesfromSorted Array

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.

It doesn't matter what you leave beyond the returned length.
Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.



/* it is so easy */
class Solution {
public:
	int removeDuplicates(vector<int>& nums) {
		int count = 0;
		int size = 0;
		if (nums.empty()) {
			return size;
		}
		else {
			size = nums.size();
			/*{1,1,1,2,2,3,3,3,4,4}*/
			int j;

			for (int i = 0; i < size; i++) {
				if (nums[count] != nums[i]) {
					count++;
					nums[count] = nums[i];


				}


			}

			size = count + 1;
			nums.resize(size);
			for (int i = 0; i < nums.size(); i++) {
				cout << nums[i] << endl;
			}
			
		}
		return size;
	}
};


/* i try it best to find some better solutions */

wow!wow!,someone ' code is only one line 
return distance(nums.begin(),unique(nums.begin(),nums.end()));
but i can not use stl,because i am not be familar with it