leetcode : remove duplicates from sorted array [基本功]

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

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn‘t matter what you leave beyond the new length.

tag ： two pinters

public class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums == null || nums.length == 0){
            return 0;
        }
        
        int len = nums.length;
        int count = 1;
        for(int i = 1; i< len; i++){
            if(nums[i - 1] == nums[i]){
                continue;
            }else{
                nums[count++] = nums[i];
                //count++;
            }
        }
        
        return count;
    }
}

leetcode : remove duplicates from sorted array [基本功]

原文：http://www.cnblogs.com/superzhaochao/p/6401135.html