-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjava_283.java
More file actions
51 lines (48 loc) · 978 Bytes
/
Copy pathjava_283.java
File metadata and controls
51 lines (48 loc) · 978 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
44
45
46
47
48
49
50
51
package leetcode;
/**
* leetcode_283
*
* 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.
*
* For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums
* should be [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.
*
* @author rwxn
*
*/
public class java_283 {
public void moveZeroes(int[] nums) {
int i = 0, j = nums.length - 1;
int tmp = 0;
while (i < j) {
while (nums[i] != 0) {
i++;
if (i > j) {
break;
}
}
while (nums[j] == 0) {
j--;
if (j < i) {
break;
}
}
int k = i + 1;
while (k <= j) {
if (nums[k] != 0) {
tmp = nums[k];
nums[k] = nums[i];
nums[i] = tmp;
i = i + 1;
k = i + 1;
} else {
k++;
}
}
}
}
}