标签：style blog color io for cti
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 class Solution { 2 public: 3 int removeDuplicates(int A[],int n){ 4 int i=0,j=0; 5 if(n<=0) 6 { 7 return n; 8 } 9 while(i<n) 10 { 11 if(A[i]>A[j]) 12 { 13 A[++j]=A[i++]; 14 } 15 else 16 { 17 i++; 18 } 19 } 20 return ++j; 21 } 22 };
LeetCode:Remove Duplicates from Sorted Array,布布扣,bubuko.com
LeetCode:Remove Duplicates from Sorted Array
标签：style blog color io for cti
原文地址：http://www.cnblogs.com/levicode/p/3855103.html
