Given a sorted array, remove the duplicates in place such that each element appear onlyonce 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 nums = [1,1,2],
Your function should return length = 2, with the first two elements ofnums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.
此题要求从排序好的数组中去除重复的元素，并返回去除后元素的个数。代码如下：
int removeDuplicates(vector<int>& nums) {int length = nums.size();if (length == 0)return 0;int j=0;for (int i=1; i<length; i++){if(nums[i] == nums[j])continue;else{nums[++j] = nums[i];}}return j+1;}
，那风再温柔。太深的流连便成了一种羁绊，
