Movatterモバイル変換


[0]ホーム

URL:


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

Commit825dab1

Browse files
committed
update: 283
1 parent32b6010 commit825dab1

File tree

2 files changed

+28
-0
lines changed

2 files changed

+28
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -90,6 +90,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
9090
|240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)|[JavaScript](./src/search-a-2d-matrix-ii/res.js)|Medium|
9191
|274|[H-Index](https://leetcode.com/problems/h-index/)|[JavaScript](./src/h-index/res.js)|Medium|
9292
|275|[H-Index II](https://leetcode.com/problems/h-index-ii/)|[JavaScript](./src/h-index-ii/res.js)|Medium|
93+
|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/)|[JavaScript](./src/move-zeroes/res.js)|Easy|
9394
|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)|[JavaScript](./src/find-the-duplicate-number/res.js)|Medium|
9495
|289|[Game of Life](https://leetcode.com/problems/game-of-life/)|[JavaScript](./src/game-of-life/res.js)|Medium|
9596
|295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)|[JavaScript](./src/find-median-from-data-stream/res.js)|Hard|

‎src/move-zeroes/res.js

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
/**
2+
*@param {number[]} nums
3+
*@return {void} Do not return anything, modify nums in-place instead.
4+
*/
5+
varmoveZeroes=function(nums){
6+
letlen=nums.length;
7+
if(len<2)returnnums;
8+
9+
constswap=(a,b)=>{
10+
consttmp=nums[a];
11+
nums[a]=nums[b];
12+
nums[b]=tmp;
13+
}
14+
15+
letcurrZero=0;
16+
for(leti=0;i<len;i++){
17+
if(nums[i]){
18+
if(currZero===i){
19+
currZero++;
20+
}else{
21+
swap(i,currZero++);
22+
}
23+
}
24+
}
25+
26+
returnnums;
27+
};

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp