【LeetCode】283.Move Zeroes解题报告

【LeetCode】283.Move Zeroes解题报告

tags: Array

题目地址：https://leetcode.com/problems/move-zeroes/#/description
题目描述：

  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.

Solutions:

正解：

public class Solution {
    public void moveZeroes(int[] nums) {
        if (nums == null || nums.length == 0) return; 
        int j = 0;
        for(int i = 0; i < nums.length; i++) {
            if(nums[i] != 0) {
                int temp = nums[j];
                nums[j] = nums[i];
                nums[i] = temp;
                j++;
            }
        }
    }
}

  思想就是说从前向后遍历，每遇到一个非o的就和最前面的0交换位置。

Date：2017年6月2日