refactor 153

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_153.java

@@ -2,35 +2,45 @@
 
 /**
  * 153. Find Minimum in Rotated Sorted Array
- * Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
 
- (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
+  Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
+
+ (i.e.,  [0,1,2,4,5,6,7] might become  [4,5,6,7,0,1,2]).
 
  Find the minimum element.
 
  You may assume no duplicate exists in the array.
+
+ Example 1:
+ Input: [3,4,5,1,2]
+ Output: 1
+
+ Example 2:
+ Input: [4,5,6,7,0,1,2]
+ Output: 0
+
  */
 public class _153 {
-
+  public static class Solution1 {
     public int findMin(int[] nums) {
-        int left = 0;
-        int right = nums.length - 1;
-        if (nums[left] < nums[right]) {
-            return nums[left];
-        }
-        int min = nums[0];
-        while (left + 1 < right) {
-            int mid = left + (right - left) / 2;
-            min = Math.min(min, nums[mid]);
-            if (nums[mid] > nums[left]) {
-                min = Math.min(nums[left], min);
-                left = mid + 1;
-            } else if (nums[mid] < nums[left]) {
-                right = mid - 1;
-            }
+      int left = 0;
+      int right = nums.length - 1;
+      if (nums[left] < nums[right]) {
+        return nums[left];
+      }
+      int min = nums[0];
+      while (left + 1 < right) {
+        int mid = left + (right - left) / 2;
+        min = Math.min(min, nums[mid]);
+        if (nums[mid] > nums[left]) {
+          min = Math.min(nums[left], min);
+          left = mid + 1;
+        } else if (nums[mid] < nums[left]) {
+          right = mid - 1;
         }
-        min = Math.min(min, Math.min(nums[left], nums[right]));
-        return min;
+      }
+      min = Math.min(min, Math.min(nums[left], nums[right]));
+      return min;
     }
-
+  }
 }

src/test/java/com/fishercoder/_153Test.java

@@ -1,61 +1,51 @@
 package com.fishercoder;
 
 import com.fishercoder.solutions._153;
-import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertEquals;
 
-/**
- * Created by fishercoder on 1/10/17.
- */
 public class _153Test {
-    private static _153 test;
-    private static int expected;
-    private static int actual;
-    private static int[] nums;
-
-    @BeforeClass
-    public static void setup() {
-        test = new _153();
-    }
-
-    @Before
-    public void setupForEachTest() {
-    }
-
-    @Test
-    public void test1() {
-
-        nums = new int[]{4, 5, 6, 7, 0, 1, 2};
-        expected = 0;
-        actual = test.findMin(nums);
-        assertEquals(expected, actual);
-
-    }
-
-    @Test
-    public void test2() {
-        nums = new int[]{1};
-        expected = 1;
-        actual = test.findMin(nums);
-        assertEquals(expected, actual);
-    }
-
-    @Test
-    public void test3() {
-        nums = new int[]{2, 1};
-        expected = 1;
-        actual = test.findMin(nums);
-        assertEquals(expected, actual);
-    }
-
-    @Test
-    public void test4() {
-        nums = new int[]{2, 3, 4, 5, 1};
-        expected = 1;
-        actual = test.findMin(nums);
-        assertEquals(expected, actual);
-    }
+  private static _153.Solution1 solution1;
+  private static int expected;
+  private static int actual;
+  private static int[] nums;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _153.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    nums = new int[] {4, 5, 6, 7, 0, 1, 2};
+    expected = 0;
+    actual = solution1.findMin(nums);
+    assertEquals(expected, actual);
+  }
+
+  @Test
+  public void test2() {
+    nums = new int[] {1};
+    expected = 1;
+    actual = solution1.findMin(nums);
+    assertEquals(expected, actual);
+  }
+
+  @Test
+  public void test3() {
+    nums = new int[] {2, 1};
+    expected = 1;
+    actual = solution1.findMin(nums);
+    assertEquals(expected, actual);
+  }
+
+  @Test
+  public void test4() {
+    nums = new int[] {2, 3, 4, 5, 1};
+    expected = 1;
+    actual = solution1.findMin(nums);
+    assertEquals(expected, actual);
+  }
 }