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

public class Solution {
    /*
     * @param nums: An ineger array
     * @return: An integer
     */
    public int removeDuplicates(int[] nums) {
       if (nums.length == 0) {
           return 0;
       }
      int len = 0;
        for (int i = 1; i < nums.length; i++) {
            if(nums[len] != nums[i]) {
                nums[++len] = nums[i];
            }
        }
        return len+1;
    }
}

 

转载于:https://www.cnblogs.com/cnmoti/p/10828461.html