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 array A =[1, 1, 2],

Your function shocould return length =2, And a is now[1, 2].

Idea: Because the input data is ordered, we only need to compare the current element with the end element of the new sequence. If it is the same, the current element is skipped; otherwise, the current element is added to the end of the new sequence.

 1   Class Solution {  2   Public  :  3       Int Removeduplicates ( Int A [], Int  N ){  4           If (N = 0 ){ Return   0  ;}  5          Int Pos = 0  ;  6           For ( Int I = 1 ; I <n; ++ I ){  7               If (A [POS]! = A [I]) {A [++ POS] = A [I];}  8   }  9           Return Pos +1  ;  10   }  11 };

 

Remove duplicates from sorted Array