Skip to content

Commit 45b1e32

Browse files
authored
add js solution to leetcode: No.80 (#365)
* add js solution to leetcode: No.80 * change formatting
1 parent b738747 commit 45b1e32

File tree

3 files changed

+59
-1
lines changed

3 files changed

+59
-1
lines changed

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md

+21
Original file line numberDiff line numberDiff line change
@@ -147,6 +147,27 @@ public class Solution {
147147
}
148148
```
149149

150+
### **JavaScript**
151+
152+
``` JavaScript
153+
/**
154+
* @param {number[]} nums
155+
* @return {number}
156+
*/
157+
var removeDuplicates = function (nums) {
158+
if (nums.length == 0) return 0;
159+
let len = nums.length;
160+
let j = 0;
161+
for (let i = 0; i < nums.length - 1; i++) {
162+
if (nums[i] != nums[i - 1] || nums[i] != nums[i + 1]) {
163+
nums[j++] = nums[i];
164+
}
165+
}
166+
nums[j] = nums[len - 1];
167+
return j + 1;
168+
};
169+
```
170+
150171
### **...**
151172

152173
```

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md

+22-1
Original file line numberDiff line numberDiff line change
@@ -125,6 +125,28 @@ public class Solution {
125125
return cur;
126126
}
127127
}
128+
```
129+
130+
### **JavaScript**
131+
132+
``` JavaScript
133+
/**
134+
* @param {number[]} nums
135+
* @return {number}
136+
*/
137+
var removeDuplicates = function (nums) {
138+
if (nums.length == 0) return 0;
139+
let len = nums.length;
140+
let j = 0;
141+
for (let i = 0; i < nums.length - 1; i++) {
142+
if (nums[i] != nums[i - 1] || nums[i] != nums[i + 1]) {
143+
nums[j++] = nums[i];
144+
}
145+
}
146+
nums[j] = nums[len - 1];
147+
return j + 1;
148+
};
149+
```
128150

129151
### **...**
130152

@@ -133,4 +155,3 @@ public class Solution {
133155
```
134156

135157
<!-- tabs:end -->
136-
```
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
/**
2+
* @param {number[]} nums
3+
* @return {number}
4+
*/
5+
var removeDuplicates = function (nums) {
6+
if (nums.length == 0) return 0;
7+
let len = nums.length;
8+
let j = 0;
9+
for (let i = 0; i < nums.length - 1; i++) {
10+
if (nums[i] != nums[i - 1] || nums[i] != nums[i + 1]) {
11+
nums[j++] = nums[i];
12+
}
13+
}
14+
nums[j] = nums[len - 1];
15+
return j + 1;
16+
};

0 commit comments

Comments
 (0)