-
Notifications
You must be signed in to change notification settings - Fork 0
/
26. Remove Duplicates from Sorted Array.java
51 lines (37 loc) · 1.23 KB
/
26. Remove Duplicates from Sorted Array.java
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
/***
Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.
Example 1:
Given 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 returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn't matter what values are set beyond the returned length.
Clarification:
Confused why the returned value is an integer but your answer is an array?
Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
**/
class Solution {
public int removeDuplicates(int[] nums) {
int count = 0;
if(nums.length >0){
int n = nums[0];
int j = 1;
count = 1;
int i = 1;
while(i < nums.length){
if(n == nums[i])
i++;
else{
count++;
n = nums[i];
nums[j] = n;
j++;
}
}
}
return count;
}
}