Create Find_Minimum_in_Rotated_Sorted_Array.cc

For the reason that it assumes no duplicate exists in the array...This problem seems more easier...

Author: iphkwan

Find_Minimum_in_Rotated_Sorted_Array.cc

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int findMin(vector<int> &num) {
+        int L = 0, R = num.size() - 1, M;
+        if (R < 0) return -1;
+        while (L < R) {
+            M = L + (R - L) / 2;
+            if (num[M] > num[R])
+                L = M + 1;
+            else
+                R = M;
+        }
+        return num[L];
+    }
+};