-
Notifications
You must be signed in to change notification settings - Fork 21
/
RemoveDuplicatesFromSortedArrayII.js
67 lines (58 loc) · 1.3 KB
/
RemoveDuplicatesFromSortedArrayII.js
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
65
66
67
/**
* Follow up for RemoveDuplicatesFromSortedArray:
* What if duplicates are allowed at most twice?
* <p>
* For example,
* Given sorted array nums = [1,1,1,2,2,3],
* <p>
* Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3.
* It doesn't matter what you leave beyond the new length.
* <p>
* Accepted.
*/
/**
* @param {number[]} nums
* @return {number}
*/
let removeDuplicates = function (nums) {
if (nums == null) {
return 0;
}
if (nums.length <= 2) {
return nums.length;
}
let i = 0;
while (i < (nums.length - 2)) {
if (nums[i + 1] === nums[i] && nums[i + 2] === nums[i]) {
nums.splice(i + 2, 1);
} else {
i++;
}
}
return nums.length;
};
if (removeDuplicates([1, 1, 1, 2, 2, 3]) === 5) {
console.log("pass")
} else {
console.error("failed")
}
if (removeDuplicates([1, 1, 2, 2, 3]) === 5) {
console.log("pass")
} else {
console.error("failed")
}
if (removeDuplicates(null) === 0) {
console.log("pass")
} else {
console.error("failed")
}
if (removeDuplicates([1, 1]) === 2) {
console.log("pass")
} else {
console.error("failed")
}
if (removeDuplicates([1, 1, 1, 1]) === 2) {
console.log("pass")
} else {
console.error("failed")
}