FilesExpand file tree

 master

/

RemoveDuplicatesfromSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (42 loc) · 1.37 KB

 master

/

RemoveDuplicatesfromSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (42 loc) · 1.37 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

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

// 26. Remove Duplicates from Sorted Array QuestionEditorial Solution My Submissions

// Total Accepted: 169724

// Total Submissions: 485998

// Difficulty: Easy

// Contributors: Admin

// 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 nums = [1,1,2],

// 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.

// Subscribe to see which companies asked this question

// Hide Tags Array Two Pointers

// Show Similar Problems

public class Solution {

public int removeDuplicates(int[] nums)

{

int len = nums.length;

if(len == 0)

return 0;

if(len == 1)

return 1;

int result = 0;

int i,j;

i=0;

j=1;

int temp;

while(i<len && j<len)

{

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

{

j++;

}

else

{

i++;

nums[i]=nums[j];

j++;

}

}

return ++i;

}

}