-
Notifications
You must be signed in to change notification settings - Fork 40
/
MoveZeroes.js
32 lines (30 loc) · 912 Bytes
/
MoveZeroes.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
// Source : https://leetcode.com/problems/move-zeroes
// Author : Dean Shi
// Date : 2020-04-04
/***************************************************************************************
* Given an array nums, write a function to move all 0's to the end of it while
* maintaining the relative order of the non-zero elements.
*
* Example:
*
* Input: [0,1,0,3,12]
* Output: [1,3,12,0,0]
*
* Note:
*
* You must do this in-place without making a copy of the array.
* Minimize the total number of operations.
*
***************************************************************************************/
/**
* @param {number[]} nums
* @return {void} Do not return anything, modify nums in-place instead.
*/
var moveZeroes = function(nums) {
let pt = 0
for (let i = 0; i < nums.length; i++) {
if (nums[i] !== 0) {
[nums[i], nums[pt++]] = [0, nums[i]]
}
}
};