Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f5cdb14

Browse files
update: 80
1 parent 1688231 commit f5cdb14

File tree

2 files changed

+26
-0
lines changed

2 files changed

+26
-0
lines changed

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -38,6 +38,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
3838
|71|[Simplify Path](https://leetcode.com/problems/simplify-path/) | [JavaScript](./src/simplify-path/res.js)|Medium|
3939
|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [JavaScript](./src/set-matrix-zeroes/res.js)|Medium|
4040
|75|[Sort Colors](https://leetcode.com/problems/sort-colors/) | [JavaScript](./src/sort-colors/res.js)|Medium|
41+
|80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [JavaScript](./src/remove-duplicates-from-sorted-array-ii/res.js)|Medium|
4142
|91|[Decode Ways](https://leetcode.com/problems/decode-ways/) | [JavaScript](./src/decode-ways/res.js)|Medium|
4243
|93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | [JavaScript](./src/restore-ip-addresses/res.js)|Medium|
4344
|120|[Triangle](https://leetcode.com/problems/triangle/) | [JavaScript](./src/triangle/res.js)|Medium|
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
/*
2+
* @Author: hijiangtao@gmail.com
3+
* @Date: 2019年10月08日 20:44:59
4+
* @Last Modified time: 2019年10月08日 20:45:19
5+
*/
6+
7+
/**
8+
* @param {number[]} nums
9+
* @return {number}
10+
*/
11+
const removeDuplicates = function(nums) {
12+
return solutionK(nums, 2);
13+
};
14+
15+
const solutionK = (nums, k) => {
16+
let index = 0;
17+
18+
for (let i=0; i<nums.length; i++) {
19+
if (index < k || nums[i] !== nums[index-k]) {
20+
nums[index++] = nums[i];
21+
}
22+
}
23+
24+
return index;
25+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /