add more solutions

Author: kamyu104

C++/findMinimumInRotatedSortedArray.cpp

@@ -10,17 +10,17 @@ class Solution {
 
         while (start < end) {
             if (num[start] <= num[end - 1])
-            return num[start];
+                return num[start];
 
             int mid = start + (end - start)/2;
 
             if (num[mid] >= num[start]) {
                 start = mid + 1;
             } else {
                 if (mid == end - 1)
-                return num[mid];
+                    return num[mid];
                 else
-                end = mid + 1;
+                    end = mid + 1;
             }
         }