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

//空间复杂度为：1

public class Solution {    public int removeDuplicates(int[] nums) {        //不能开辟新的kongjian        Set<Integer> set=new TreeSet<Integer>();        for(int i=0;i<nums.length;i++){            set.add(nums[i]);        }        return set.size();    }}//不满足空间复杂度

public class Solution {    public int removeDuplicates(int[] nums) {        //不能开辟新的kongjian       // Set<Integer> set=new TreeSet<Integer>();       int sum=0;        for(int i=0;i<nums.length;i++){            if(nums[sum]!=nums[i]){nums[++sum]=nums[i];}        }        return sum+1;    }}