1.利用荷兰国旗的思路，每次记住最后一个位置，遇到一个不重复的数，放在它后面，代码很简单。
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 A = [1,1,2],
Your function should return length = 2, and A is now [1,2].
1 public class Solution { 2 public int removeDuplicates(int[] A) { 3 int len=A.length; 4 if(len==0) return 0; 5 int pos=0; 6 7 8 for(int i=1;i<len;i++) 9 { 10 if(A[i]!=A[pos]) 11 { 12 pos++; 13 A[pos]=A[i]; 14 15 16 } 17 18 19 } 20 return pos+1; 21 22 23 24 } 25 26 }
2.只要跟end的前一个比较就行了，思路跟上边，就一点不一样，原创啊
Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,2,3].
1 public class Solution { 2 public int removeDuplicates(int[] A) { 3 int len=A.length; 4 if(len==0) return 0; 5 if(len==1) return 1; 6 int end=1; 7 for(int i=2;i<len;i++) 8 { 9 if(A[i]!=A[end-1]) 10 { 11 end++; 12 A[end]=A[i]; 13 14 15 } 16 17 } 18 19 return end+1; 20 21 } 22 }