LeetCode 26. 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.

Subscribe to see which companies asked this question.

返回一个前n位已经包含了所有唯一数字的有序数组。

import java.util.HashSet;public class Solution {    public int removeDuplicates(int[] nums) {        if(nums==null||nums.length==0){            return 0;        }        if(nums.length==1){            return 1;        }        int i=1,j=0;        while(j<nums.length){            if(j>0&&nums[j]>nums[j-1]){                while(i>0&&i<j&&nums[i]>nums[i-1]){                    i++;                }                nums[i]=nums[j];                if(nums[i]==nums[nums.length-1]){                    return i+1;                }            }            j++;        }        return i;    }}