题目链接：https://leetcode.com/problems/remove-duplicates-from-sorted-array/
Given a sorted array, remove the duplicates in place such that each element appear onlyonceand 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 arraynums=[1,1,2],
Your function should return length =2, with the first two elements ofnumsbeing1and2respectively. It doesn’t matter what you leave beyond the new length.
int removeDuplicates(int* nums, int numsSize) {if(numsSize <= 1)//如果少于一个元素，，没有重复元return numsSize;int index = 0;//标记删除重复元后的最后一个元素下标for(int i = 1; i < numsSize; ++i) //遍历数组，如果当前元素与前一个不相同，加入到已处理数组中if(nums[i] != nums[index])nums[++index] = nums[i]; //删除后的数组永远小于原来数组，所以可以直接在原数组上储存return index + 1;}
版权声明：本文为博主原创文章，未经博主允许不得转载。
君子当权积福，小人仗势欺人。
