LeetCode & Q26-Remove Duplicates from Sorted Array-Easy

Descriptions:

Given a sorted array, remove the duplicates in place such that each element appears onlyonceand 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 arraynums=[1,1,2],

Your function should return length =2, with the first two elements ofnumsbeing1and2respectively. It doesn't 't matter what you leave beyond the new length.

I have always had problems with what I wrote... I used a HashSet collection and have not studied this type. The output result of [1,1,2] is always [1,1]

(Write it down in a notebook to study HashSet)

import java.util.HashSet; import java.util.Set; public class Solution { public static int removeDuplicates(int[] nums) { Set tempSet = new HashSet<>(); for(int i = 0; i < nums.length; i++) { Integer wrap = Integer.valueOf(nums[i]); tempSet.add(wrap); } return tempSet.size(); } }

The following are excellent answers

Solutions:

public class Solution { public static int removeDuplicates(int[] nums) { int j = 0; for(int i = 0; i < nums.length; i++) { if(nums[i] != nums[j]) { nums[++j] = nums[i]; } } return ++j; } }

There are two points to note:

1. Because there may be multiple duplicates, equality cannot be used as the judgment condition
2. Pay attention to the difference betweenj++and++j. The usage here is very clever and necessary!

The above is the detailed content of LeetCode & Q26-Remove Duplicates from Sorted Array-Easy. For more information, please follow other related articles on the PHP Chinese website!