[LeetCode] 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:

解題思路

用兩個指針i，j分別指向0和非零，當j指向非零時，交換兩個指針所指向的元素，並且i向前走一步；j則每次循環無論是否交換都向前走一步。

實現代碼

C++：

// Runtime: 20 ms
class Solution {
public:
    void moveZeroes(vector& nums) {
        int i = 0;
        int j = 0;
        while (j < nums.size())
        {
            if (nums[j] != 0)
            {
                swap(nums[i], nums[j]);
                i++;
            }
            j++;
        }
    }
};

Java：

// Runtime: 1 ms
public class Solution {
    public void moveZeroes(int[] nums) {
        int i = 0;
        int j = 0;
        while (j < nums.length) {
            if (nums[j] != 0) {
                if (j != i) {
                    int temp = nums[i];
                    nums[i] = nums[j];
                    nums[j] = temp;
                }
                i++;
            }
            j++;
        }
    }
}