FilesExpand file tree

 master

/

RemoveDuplicatesfromSortedArray.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

33 lines (30 loc) · 699 Bytes

 master

/

RemoveDuplicatesfromSortedArray.java

Top

File metadata and controls

• Code
• Blame

33 lines (30 loc) · 699 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

/**

* 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 A = [1,1,2],

*

* Your function should return length = 2, and A is now [1,2].

*/

public class RemoveDuplicatesfromSortedArray {

public int removeDuplicates(int[] A) {

if (A.length == 0)

return 0;

else if (A.length == 1)

return 1;

else {

int ret = 1;

int p = 0;

for (int p1 = 1; p1 < A.length; p1++) {

if (A[p1 - 1] != A[p1]) {

ret++;

A[++p] = A[p1];

}

}

return ret;

}

}

}