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.

    分析

这题跟 "Remove Element" 思路一模一样，只是最后要把后半截设置为0。

代码

  1. // Move Zeroes
  2. // Time Complexity: O(n), Space Complexity: O(1)
  3. public class Solution {
  4.     public void moveZeroes(int[] nums) {
  5.         int index = 0;
  6.         for (int i = 0; i < nums.length; ++i) {
  7.             if (nums[i] != 0) {
  8.                 nums[index++] = nums[i];
  9.             }
  10.         }
  11.         for (int i = index; i < nums.length; ++i) {
  12.             nums[i] = 0;
  13.         }
  14.     }
  15. }

相关题目

原文: https://soulmachine.gitbooks.io/algorithm-essentials/content/java/linear-list/array/move-zeroes.html