-
-
Notifications
You must be signed in to change notification settings - Fork 27
Expand file tree
/
Copy path283. Move Zeroes.java
More file actions
executable file
·43 lines (37 loc) · 982 Bytes
/
283. Move Zeroes.java
File metadata and controls
executable file
·43 lines (37 loc) · 982 Bytes
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
33
34
35
36
37
38
39
40
41
42
43
E
tags: Array, Two Pointers
time: O(n)
space: O(1)
Move non-zero elements to front of array; preseve order.
#### Two Pointers
- Outside pointer that moves in certain condition.
- Save appropirate elements
```
/*
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.
*/
/*
Pick non-zero and assign to front. Use a pointer to track
- Use pointer to move all elements to non-zero index.
- set remaining list -> 0
*/
class Solution {
public void moveZeroes(int[] nums) {
if (nums == null) return;
int index = 0, n = nums.length;
for (int i = 0; i < n; i++) {
if (nums[i] != 0) nums[index++] = nums[i];
}
for (int i = index; i < n; i++) {
nums[i] = 0;
}
}
}
```