LintCode 移动零题目分析

public class Solution {
    /**
     * @param nums an integer array
     * @return nothing, do this in-place
     */
    public void moveZeroes(int[] A) {
        // Write your code here
        int fast=0,slow=0;  
        int n=A.length;   
          
        while(fast<n){  
            if(A[fast]!=0){  
                A[slow]=A[fast];  
                ++slow;  
            }  
            ++fast;  
        }
        for(int i=slow;i<n;i++)
            A[i] = 0;
    }
}