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.
只用了简单的冲刷,从后面开始往前面删。。。然而效率还是不算太高
public class Solution {
public void moveZeroes(int[] nums) {
for(int i = nums.length-1; i >=0 ; i--){
if(nums[i] == 0){
for(int j = i ; j <= nums.length-2;j++){
nums[j] = nums[j+1];
}
nums[nums.length-1] = 0;
}
}
}
}
虽然代码写的不是很好,但是每天每天看自己的代码,数据结构,算法有进步,心里还是很开心的~
后来又看了一下讨论区的代码,把代码优化了一下~
public class Solution {
public void moveZeroes(int[] nums) {
int temp = 0;
for(int i = 0; i <nums.length ; i++){
if(nums[i]!=0)
nums[temp++]=nums[i];
}
for(int i = temp;i < nums.length;i++)
nums[i] = 0;
}
}