您的位置:首页 > 其它

283. Move Zeroes

2016-03-03 00:24 399 查看
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) {
int cnt = 0, pos = 0;
// 将非0数字都尽可能向前排
for(int i = 0; i < nums.length; i++){
if(nums[i] != 0){
nums[pos]= nums[i];
pos++;
}
}

// 将剩余的都置0
for(;pos<nums.length; pos++){
nums[pos] = 0;
}
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: