283. Move Zeroes

Posted wx62ea2466cca9a

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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.

public class Solution 
public void moveZeroes(int[] nums)
for (int i = 0, j = 0; i < nums.length; i++)
if (nums[i] != 0)
if (i != j)
nums[j] = nums[i];
nums[i] = 0;

j++;




以上是关于283. Move Zeroes的主要内容,如果未能解决你的问题,请参考以下文章

283. Move Zeroes

283. Move Zeroes

算法:移动零283. Move Zeroes

LeetCode 283. Move Zeroes

283. Move Zeroes

283. Move Zeroes