-
Notifications
You must be signed in to change notification settings - Fork 31
/
Copy path283. Move Zeroes.c
45 lines (27 loc) · 962 Bytes
/
283. Move Zeroes.c
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
/*
283. Move Zeroes
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.
Credits:Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
*/
void moveZeroes(int* nums, int numsSize) {
int i, j, k;
for (i = 0, j = 0; j < numsSize; j ++) {
if (nums[j] != 0) {
nums[i ++] = nums[j];
}
}
memset(&nums[i], 0, (j - i) * sizeof(int));
}
/*
Difficulty:Easy
Total Accepted:202.9K
Total Submissions:407K
Companies Bloomberg Facebook
Related Topics Array Two Pointers
Similar Questions
Remove Element
*/