add find min in rotated array ii

Author: tg123

find-minimum-in-rotated-sorted-array-ii/README.md

@@ -0,0 +1,30 @@
+public class Solution {
+    public int findMin(int[] num) {
+        if(num.length == 1) return num[0];
+        if(num.length == 2) return Math.min(num[0], num[1]);
+
+        int s = 0;
+        int e = num.length;
+
+        int m = (s + e) / 2;
+
+        // bad case
+        if (num[s] == num[m] && num[m] == num[e - 1]){
+            return Math.min(num[s], findMin(Arrays.copyOfRange(num, s + 1, e)));
+        }
+
+        // s < m < e
+        if ( num[s] <= num[m] && num[m] <= num[e - 1]){
+            return num[s];
+        }
+
+        // s < m > e
+        if ( num[s] <= num[m] && num[m] >= num[e - 1]){
+            return findMin(Arrays.copyOfRange(num, m, e));
+        }
+
+        // s > m < e
+        return findMin(Arrays.copyOfRange(num, s, m + 1));
+
+    }
+}

find-minimum-in-rotated-sorted-array-ii/Solution.java

@@ -0,0 +1,8 @@
+---
+layout: solution
+title: Find Minimum in Rotated Sorted Array II
+date: 2014-10-21 13:20:36+08:00
+---
+{% assign leetcode_name = {{page.path | remove: '/index.md'}}  %}
+{% assign leetcode_readme = {{leetcode_name | append: '/README.md' | prepend: '_root/' }}  %}
+{% include {{leetcode_readme}} %}