FilesExpand file tree

 master

/

RemoveDuplicates.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

34 lines (32 loc) · 991 Bytes

 master

/

RemoveDuplicates.java

Top

File metadata and controls

• Code
• Blame

34 lines (32 loc) · 991 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

/**

* Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.

* <p>

* Example 1:

* <p>

* Given nums = [1,1,2],

* <p>

* Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.

* <p>

* It doesn't matter what you leave beyond the returned length.

* Example 2:

* <p>

* Given nums = [0,0,1,1,1,2,2,3,3,4],

* <p>

* Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

* <p>

* It doesn't matter what values are set beyond the returned length.

* </p>

*/

public class RemoveDuplicates {

public int removeDuplicates(int[] nums) {

if (nums.length == 0) return 0;

int i = 0;

for (int j = 1; j < nums.length; j++) {

if (nums[j] != nums[i]) {

i++;

nums[i] = nums[j];

}

}

return i + 1;

}

}