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 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 new length.
给定一个有序数组,去除重复数后返回出现过数字的个数。
遍历一遍数组并由后一个数把前面重复的数取代,再返回指针就是要求的结果。
public class Solution {
public int RemoveDuplicates(int[] A) {
if (A.Length==0) return 0;
int j=0;
for (int i=0; i<A.Length; i++)
if (A[i]!=A[j]) A[++j]=A[i];
return ++j;
}
}