友情支持
如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜
|
|
有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。
公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。 |
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.
Example:
Input:Output:[0,1,0,3,12][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.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/**
* Runtime: 0 ms, faster than 100.00% of Java online submissions for Move Zeroes.
*
* Memory Usage: 38 MB, less than 93.01% of Java online submissions for Move Zeroes.
*
* @author D瓜哥 · https://www.diguage.com
* @since 2020-01-05 22:26
*/
public void moveZeroes(int[] nums) {
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) {
count++;
continue;
}
nums[i - count] = nums[i];
}
for (int i = nums.length - count; i < nums.length; i++) {
nums[i] = 0;
}
}