FilesExpand file tree

 master

/

RemoveDuplicatesFromSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

35 lines (30 loc) · 813 Bytes

 master

/

RemoveDuplicatesFromSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

35 lines (30 loc) · 813 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

35

/**

* Practiced on 12/19/2012

*

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

*/

package com.congli.leetcode;

public class RemoveDuplicatesFromSortedArray {

public int removeDuplicates(int[] A)

{

if(A == null || A.length == 0) return 0;

int start = 1;

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

{

if(A[i] != A[i-1])

{

A[start] = A[i];

++start;

}

}

return start;

}

}