refactor 189

fishercoder1534 · fishercoder1534 · commit 2a515c2b4199 · 2019-03-11T20:29:59.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_189.java b/src/main/java/com/fishercoder/solutions/_189.java
@@ -49,7 +49,7 @@ public static class Solution2 {
      * My original idea and got AC'ed.
      * One thing to notice is that when k > nums.length, we'll continue to rotate_naive the array, it just becomes k -= nums.length
      */
-    public static void rotate_naive(int[] nums, int k) {
+    public static void rotate(int[] nums, int k) {
       if (k == 0 || k == nums.length) {
         return;
       }
@@ -77,7 +77,7 @@ public static void rotate_naive(int[] nums, int k) {
       }
     }
   }
- 
+
    public static class Solution3 {
     public void rotate(int[] nums, int k) {
         int tmp = 0;
@@ -90,5 +90,5 @@ public void rotate(int[] nums, int k) {
         }
     }
   }
- 
+
 }

Original file line number	Diff line number	Diff line change
`@@ -49,7 +49,7 @@ public static class Solution2 {`
`49`	`49`	`* My original idea and got AC'ed.`
`50`	`50`	`* One thing to notice is that when k > nums.length, we'll continue to rotate_naive the array, it just becomes k -= nums.length`
`51`	`51`	`*/`
`52`		`- public static void rotate_naive(int[] nums, int k) {`
	`52`	`+ public static void rotate(int[] nums, int k) {`
`53`	`53`	`if (k == 0 \|\| k == nums.length) {`
`54`	`54`	`return;`
`55`	`55`	`}`
`@@ -77,7 +77,7 @@ public static void rotate_naive(int[] nums, int k) {`
`77`	`77`	`}`
`78`	`78`	`}`
`79`	`79`	`}`
`80`		`-`
	`80`	`+`
`81`	`81`	`public static class Solution3 {`
`82`	`82`	`public void rotate(int[] nums, int k) {`
`83`	`83`	`int tmp = 0;`
`@@ -90,5 +90,5 @@ public void rotate(int[] nums, int k) {`
`90`	`90`	`}`
`91`	`91`	`}`
`92`	`92`	`}`
`93`		`-`
	`93`	`+`
`94`	`94`	`}`