LintCode- 删除排序数组中的重复数字

 1 public class Solution {
 2     /**
 3      * @param A: a array of integers
 4      * @return : return an integer
 5      */
 6     public int removeDuplicates(int[] nums) {
 7         // write your code here
 8         int length = nums.length;
 9         if(length==0){
10             return 0;
11         }
12         for(int i=0;i<length-1;i++){
13             if(nums[i+1]==nums[i]){
14                 
15                 for(int j=i;j<length-1;j++){
16                     nums[j] = nums[j+1];
17                 }
18                 length--;
19                 i--;
20             }
21         }
22         
23         return length;
24     }
25 }