first easy after a happy holiday

Author: tg123

move-zeroes/README.md

@@ -0,0 +1,49 @@
+public class Solution {
+
+    void shiftLeft(int[] nums, int p, final int c){
+        if(c <= 0) return;
+
+        while(p < nums.length){
+            nums[p - c] = nums[p];
+
+            if(nums[p] == 0) break;
+
+            p++;
+        }
+
+        for(int i = p - c; i < p; i++){
+            nums[i] = 0;
+        }
+    }
+
+    public void moveZeroes(int[] nums) {
+
+        int i = nums.length - 1;
+
+        // trim tailing zero
+        while(i >= 0 && nums[i] == 0) i--;
+
+        int s = i;
+
+        boolean metzero = false;
+
+        while(i >= 0){
+
+            if(nums[i] != 0){
+
+                if(metzero){
+                    shiftLeft(nums, s, s - i - 1);
+                    metzero = false;
+                }
+
+                s = i;
+            } else {
+                metzero = true;
+            }
+
+            i--;
+        }
+
+        shiftLeft(nums, s, s);
+    }
+}

move-zeroes/Solution.java

@@ -0,0 +1,7 @@
+---
+layout: solution
+title: Move Zeroes
+date: 2015-09-24 15:55:37+08:00
+leetcode_id: 283
+---
+{% include_relative README.md %}