-
Notifications
You must be signed in to change notification settings - Fork 14
/
RemoveDuplicatesFromSortedArray_II.java
64 lines (60 loc) · 2.36 KB
/
RemoveDuplicatesFromSortedArray_II.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
52
53
54
55
56
57
58
59
60
61
62
63
64
package by.andd3dfx.collections;
/**
* <pre>
* <a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/">Task description</a>
*
* Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique
* element appears at most twice. The relative order of the elements should be kept the same.
*
* Since it is impossible to change the length of the array in some languages, you must instead have the result be
* placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates,
* then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first
* k elements.
*
* Return k after placing the final result in the first k slots of nums.
*
* 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:
*
* Input: nums = [1,1,1,2,2,3]
* Output: 5, nums = [1,1,2,2,3,_]
* Explanation: Your function should return k = 5, with the first five elements of nums being 1, 1, 2, 2 and 3
* respectively.
* It does not matter what you leave beyond the returned k (hence they are underscores).
*
* Example 2:
*
* Input: nums = [0,0,1,1,1,1,2,3,3]
* Output: 7, nums = [0,0,1,1,2,3,3,_,_]
* Explanation: Your function should return k = 7, with the first seven elements of nums being 0, 0, 1, 1, 2, 3 and 3
* respectively.
* It does not matter what you leave beyond the returned k (hence they are underscores).
* </pre>
*
* @see <a href="https://youtu.be/gbReaBoFHkc">Video solution</a>
*/
public class RemoveDuplicatesFromSortedArray_II {
public int removeDuplicates(int[] nums) {
var left = 0;
var right = 1;
var counter = 1;
while (right < nums.length) {
while (right < nums.length && nums[left] == nums[right]) {
if (counter < 2) {
counter++;
}
right++;
}
while (right < nums.length && nums[left] != nums[right]) {
if (right - left > 1) {
nums[left + counter] = nums[right];
}
left++;
right++;
}
}
return left + counter;
}
}