Remove Duplicates from Sorted Array （java版）

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.

Subscribe to see which companies asked this question.

思路如下：

1、此题为删除数组中重复的元素，返回删除元素后的数组长度

2、因数组已排序，定义i和j；用来标记数组中的位置；i=j+1；如果nums[i]=nums[j]相等，则递增i，直到nums[i]!=nums[j];再设置nums[i]=nums[j+1],同时递增i和j；直到遍历结束。

public class RemoveDuplicates {
    public static void main(String[] args) {
        int[] nums = {1,1,1};
        RemoveDuplicates r=new RemoveDuplicates();
        System.out.println(r.removeDuplicates(nums));

    }
    public int removeDuplicates(int[] nums) {
        if(nums.length==0){
            return 0;

        }

        int j=0;
        for (int i = 0; i <nums.length ; i++) {
            if(nums[j]!=nums[i]){
                nums[++j]=nums[i];

            }

        }
        return j+1;
    }
}