FilesExpand file tree

 master

/

RemoveDuplicates.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (31 loc) · 1.04 KB

 master

/

RemoveDuplicates.java

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (31 loc) · 1.04 KB

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

package two_pointers;

/**

* Created by gouthamvidyapradhan on 04/07/2017. Given a sorted array, remove the duplicates in

* place such that each element appear only once and return the new length.

*

* <p>Do not allocate extra space for another array, you must do this in place with constant memory.

*

* <p>For example, Given input array nums = [1,1,2],

*

* <p>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.

*/

public class RemoveDuplicates {

public static void main(String[] args) throws Exception {

int[] nums = {1, 1, 2};

int N = new RemoveDuplicates().removeDuplicates(nums);

for (int i = 0; i < N; i++) System.out.print(nums[i] + " ");

}

public int removeDuplicates(int[] nums) {

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

int size = 1;

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

if (nums[i] != nums[i - 1]) {

size++;

j++;

nums[j] = nums[i];

}

}

return size;

}

}