153 (3) add template solution and new tests

stevencooks · stevencooks · commit 488a1def2c81 · 2015-10-11T13:09:44.000-04:00
diff --git a/src/_153_FindMinimumInRotatedSortedArray/SolutionTemplate.java b/src/_153_FindMinimumInRotatedSortedArray/SolutionTemplate.java
@@ -0,0 +1,40 @@
+/**
+ * Time : O(lgN) ; Space: O(1)
+ * @tag : Array; Binary Search
+ * @by  : Steven Cooks
+ * @date: Aug 4, 2015
+ ***************************************************************************
+ * Description:
+ *
+ * Suppose a sorted array 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.
+ * 
+ ***************************************************************************
+ * {@link https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ }
+ */
+package _153_FindMinimumInRotatedSortedArray;
+
+/** see test {@link _153_FindMinimumInRotatedSortedArray.SolutionTemplateTest } */
+public class SolutionTemplate {
+
+    // solution that using binary search template
+    public int findMin(int[] nums) {
+        if (nums.length == 0) {
+            return 0;
+        }
+        int left = 0;
+        int right = nums.length - 1;
+        while (left + 1 < right) {
+            int mid = left + (right - left) / 2;
+            if (nums[mid] > nums[right]) {
+                left = mid;
+            } else {
+                right = mid;
+            }
+        }
+        return Math.min(nums[left], nums[right]);
+    }
+
+}
diff --git a/test/_153_FindMinimumInRotatedSortedArray/PracticeTest.java b/test/_153_FindMinimumInRotatedSortedArray/PracticeTest.java
@@ -28,30 +28,28 @@ public void tearDown() throws Exception {
 
     @Test
     public void Test1() {
-        int[] nums = { 1 };
+        int[] nums = { 2 };
         int actual = solution.findMin(nums);
-        int expected = 1;
+        int expected = 2;
         assertEquals(expected, actual);
     }
 
     @Test
     public void Test2() {
-        int[] nums = { 1, 2, 3 };
+        int[] nums = { 0, 1, 2, 3 };
         int actual = solution.findMin(nums);
-        int expected = 1;
+        int expected = 0;
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test3() {
-        int[] nums = { 2, 3, 1 };
+        int[] nums = { 3, 4, 2 };
         int actual = solution.findMin(nums);
-        int expected = 1;
+        int expected = 2;
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test4() {
         int[] nums = { 3, 1, 2 };
@@ -60,16 +58,14 @@ public void Test4() {
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test5() {
-        int[] nums = { 0, 1, 2, 3, 4 };
+        int[] nums = { 0, 1, 2, 3, 4, 5 };
         int actual = solution.findMin(nums);
         int expected = 0;
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test6() {
         int[] nums = { 4, 0, 1, 2, 3 };
diff --git a/test/_153_FindMinimumInRotatedSortedArray/SolutionTemplateTest.java b/test/_153_FindMinimumInRotatedSortedArray/SolutionTemplateTest.java
@@ -0,0 +1,86 @@
+package _153_FindMinimumInRotatedSortedArray;
+
+import static org.junit.Assert.*;
+
+import org.junit.After;
+import org.junit.Before;
+import org.junit.Rule;
+import org.junit.Test;
+import org.junit.rules.Timeout;
+
+public class SolutionTemplateTest {
+    
+    /** Test method for {@link _153_FindMinimumInRotatedSortedArray.SolutionTemplate } */
+    SolutionTemplate solution;
+
+    @Rule
+    public Timeout globalTimeout = new Timeout(200);
+
+    @Before
+    public void setUp() throws Exception {
+        solution = new SolutionTemplate();
+    }
+
+    @After
+    public void tearDown() throws Exception {
+        solution = null;
+    }
+
+    @Test
+    public void Test1() {
+        int[] nums = { 2 };
+        int actual = solution.findMin(nums);
+        int expected = 2;
+        assertEquals(expected, actual);
+    }
+
+    @Test
+    public void Test2() {
+        int[] nums = { 0, 1, 2, 3 };
+        int actual = solution.findMin(nums);
+        int expected = 0;
+        assertEquals(expected, actual);
+    }
+
+    @Test
+    public void Test3() {
+        int[] nums = { 3, 4, 2 };
+        int actual = solution.findMin(nums);
+        int expected = 2;
+        assertEquals(expected, actual);
+    }
+
+    @Test
+    public void Test4() {
+        int[] nums = { 3, 1, 2 };
+        int actual = solution.findMin(nums);
+        int expected = 1;
+        assertEquals(expected, actual);
+    }
+
+    @Test
+    public void Test5() {
+        int[] nums = { 0, 1, 2, 3, 4, 5 };
+        int actual = solution.findMin(nums);
+        int expected = 0;
+        assertEquals(expected, actual);
+    }
+
+    @Test
+    public void Test6() {
+        int[] nums = { 4, 0, 1, 2, 3 };
+        int actual = solution.findMin(nums);
+        int expected = 0;
+        assertEquals(expected, actual);
+    }
+
+
+    @Test
+    public void Test7() {
+        int[] nums = { 2, 3, 4, 0, 1 };
+        int actual = solution.findMin(nums);
+        int expected = 0;
+        assertEquals(expected, actual);
+    }
+
+}
diff --git a/test/_153_FindMinimumInRotatedSortedArray/SolutionTest.java b/test/_153_FindMinimumInRotatedSortedArray/SolutionTest.java
@@ -28,30 +28,28 @@ public void tearDown() throws Exception {
 
     @Test
     public void Test1() {
-        int[] nums = { 1 };
+        int[] nums = { 2 };
         int actual = solution.findMin(nums);
-        int expected = 1;
+        int expected = 2;
         assertEquals(expected, actual);
     }
 
     @Test
     public void Test2() {
-        int[] nums = { 1, 2, 3 };
+        int[] nums = { 0, 1, 2, 3 };
         int actual = solution.findMin(nums);
-        int expected = 1;
+        int expected = 0;
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test3() {
-        int[] nums = { 2, 3, 1 };
+        int[] nums = { 3, 4, 2 };
         int actual = solution.findMin(nums);
-        int expected = 1;
+        int expected = 2;
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test4() {
         int[] nums = { 3, 1, 2 };
@@ -60,16 +58,14 @@ public void Test4() {
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test5() {
-        int[] nums = { 0, 1, 2, 3, 4 };
+        int[] nums = { 0, 1, 2, 3, 4, 5 };
         int actual = solution.findMin(nums);
         int expected = 0;
         assertEquals(expected, actual);
     }
 
-
     @Test
     public void Test6() {
         int[] nums = { 4, 0, 1, 2, 3 };
