Leetcode 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.

一题目：

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.

二、分析

采用双指针压缩法：

把关注点放在非0元素上，而不是0。一个指针遍历数组元素，找到非零元素。一个指针记录压缩的当前位置。整体就遍历一次数据。

class Solution {
    public void moveZeroes(int[] nums) {
      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++;
        }
      }
    }
}

Leetcode 283. Move Zeroes

原文：http://www.cnblogs.com/lyr2015/p/7747182.html