Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add js solution to leetcode: No.80 #365

Merged
merged 2 commits into from
Apr 30, 2021
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -147,6 +147,27 @@ public class Solution {
}
```

### **JavaScript**

``` JavaScript
/**
* @param {number[]} nums
* @return {number}
*/
var removeDuplicates = function (nums) {
if (nums.length == 0) return 0;
let len = nums.length;
let j = 0;
for (let i = 0; i < nums.length - 1; i++) {
if (nums[i] != nums[i - 1] || nums[i] != nums[i + 1]) {
nums[j++] = nums[i];
}
}
nums[j] = nums[len - 1];
return j + 1;
};
```

### **...**

```
Original file line number Diff line number Diff line change
@@ -125,6 +125,28 @@ public class Solution {
return cur;
}
}
```

### **JavaScript**

``` JavaScript
/**
* @param {number[]} nums
* @return {number}
*/
var removeDuplicates = function (nums) {
if (nums.length == 0) return 0;
let len = nums.length;
let j = 0;
for (let i = 0; i < nums.length - 1; i++) {
if (nums[i] != nums[i - 1] || nums[i] != nums[i + 1]) {
nums[j++] = nums[i];
}
}
nums[j] = nums[len - 1];
return j + 1;
};
```

### **...**

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

<!-- tabs:end -->
```
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
/**
* @param {number[]} nums
* @return {number}
*/
var removeDuplicates = function (nums) {
if (nums.length == 0) return 0;
let len = nums.length;
let j = 0;
for (let i = 0; i < nums.length - 1; i++) {
if (nums[i] != nums[i - 1] || nums[i] != nums[i + 1]) {
nums[j++] = nums[i];
}
}
nums[j] = nums[len - 1];
return j + 1;
};