[Leetcode] remove duplicates from sorted Array

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].

Algorithm ideas:

Nothing to talk about.

Code:

 1   Public   Class  Solution { 2       Public   Int Removeduplicates ( Int  [] ){  3           If (A = Null | A. Length = 0) Return 0 ;  4           Int Index = 1 ;  5           For (Int I = 1; I <A. length; I ++ ){  6               If (A [I]! = A [I-1 ])  7 A [index ++] = A [I];  8   }  9           Return  Index;  10   }  11 }