fd

dingjikerbo · dingjikerbo · commit fde398d28153 · 2017-12-09T15:31:40.000+08:00
diff --git a/solution/src/main/java/com/inuker/solution/MoveZeroes.java b/solution/src/main/java/com/inuker/solution/MoveZeroes.java
@@ -9,6 +9,9 @@
  */
 public class MoveZeroes {
 
+    /**
+     * 要保持顺序，写的次数最少
+     */
     public void moveZeroes(int[] nums) {
         for (int i = 0, j = 0; j < nums.length; j++) {
             if (nums[j] != 0) {
@@ -24,24 +27,17 @@ private void swap(int[] nums, int i, int j) {
     }
 
     /**
-     * 要求操作次数最少，如果不要求保持顺序，无需理会超出的部分，所以这里不用swap，另外当i==j时就不要多余地操作一次了
-     * 最后返回有效部分的长度
+     * 如果不要求保持顺序，且写的次数最少
      */
     public int moveZeroes2(int[] nums) {
-        int i = 0, j = nums.length - 1;
-        while (i <= j) {
+        for (int i = 0, j = nums.length - 1; j > i; ) {
             if (nums[i] != 0) {
                 i++;
-            } else if (nums[j] == 0) {
-                j--;
+            } else if (nums[j] != 0) {
+                swap(nums, i, j--);
             } else {
-                if (i != j) {
-                    nums[i] = nums[j];
-                }
-                i++;
                 j--;
             }
         }
-        return i;
     }
 }
diff --git a/test/src/main/java/com/inuker/test/Test2.java b/test/src/main/java/com/inuker/test/Test2.java
@@ -1,5 +1,7 @@
 package com.inuker.test;
 
+import com.leetcode.library.TreeNode;
+
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.Collections;
@@ -20,45 +22,22 @@
 
 public class Test2 {
 
-    public int[] searchRange(int[] nums, int target) {
-        if (nums.length == 0) {
-            return new int[]{-1, -1};
-        }
-        return new int[] {
-                lowerBound(nums, target),
-                upperBound(nums, target)
-        };
-    }
-
-    public static int lowerBound(int[] nums, int target) {
-        int left = 0, right = nums.length - 1;
-
-        while (left < right) {
-            int mid = left + ((right - left) >> 1);
-
-            if (target > nums[mid]) {
-                left = mid + 1;
+    public void moveZeroes(int[] nums) {
+        for (int i = 0, j = nums.length - 1; j > i; ) {
+            if (nums[i] != 0) {
+                i++;
+            } else if (nums[j] != 0) {
+                swap(nums, i, j--);
             } else {
-                right = mid;
+                j--;
             }
         }
-
-        return nums[left] == target ? left : -1;
     }
 
-    public static int upperBound(int[] nums, int target) {
-        int left = 0, right = nums.length - 1;
-
-        while (left < right) {
-            int mid = left + ((right - left) >> 1) + 1;
-
-            if (target < nums[mid]) {
-                right = mid - 1;
-            } else {
-                left = mid;
-            }
-        }
-
-        return nums[right] == target ? right : -1;
+    private void swap(int[] nums, int i, int j) {
+        int t = nums[i];
+        nums[i] = nums[j];
+        nums[j] = t;
     }
+
 }
diff --git a/test/src/main/java/com/inuker/test/main.java b/test/src/main/java/com/inuker/test/main.java
@@ -28,18 +28,13 @@
 public class main {
 
     public static void main(String[] args) {
-        System.out.println(getTag("abc"));
-        System.out.println(getTag("bcd"));
-        System.out.println(getTag("cde"));
+        int[] arr = new int[] {
+                0, 0, 3, 4, 5, 0, 0
+        };
+        new Test2().moveZeroes(arr);
+        for (int n : arr) {
+            System.out.print(n + " ");
+        }
     }
 
-    static String getTag(String s) {
-        int diff = (int) s.charAt(0) - (int) 'a';
-
-        StringBuilder sb = new StringBuilder();
-        for (char c : s.toCharArray())
-            sb.append((c + 26 - diff) % 26);
-
-        return sb.toString();
-    }
 }
