fixs haoel#4

haoel · haoel · commit fd90314056da · 2014-10-23T09:09:15.000+08:00
diff --git a/src/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.II.cpp b/src/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.II.cpp
@@ -48,9 +48,10 @@ int findMin(vector<int> &num) {
         }
         //binary search
         int mid = low + (high-low)/2;
+        //If the array is not rotated then return num[low]
         //Notes: checking the equal situation
         if (num[low] <= num[mid] && num[mid] <= num[high]){
-            return num[low] < num[mid] ? num[low] : num[mid];
+            return num[low];
         }
         //move the high pointer to the middle, if sub-array from low to mid is rotated.
         if (num[low] > num [mid]){

Original file line number	Diff line number	Diff line change
`@@ -48,9 +48,10 @@ int findMin(vector<int> &num) {`
`48`	`48`	`}`
`49`	`49`	`//binary search`
`50`	`50`	`int mid = low + (high-low)/2;`
	`51`	`+ //If the array is not rotated then return num[low]`
`51`	`52`	`//Notes: checking the equal situation`
`52`	`53`	`if (num[low] <= num[mid] && num[mid] <= num[high]){`
`53`		`- return num[low] < num[mid] ? num[low] : num[mid];`
	`54`	`+ return num[low];`
`54`	`55`	`}`
`55`	`56`	`//move the high pointer to the middle, if sub-array from low to mid is rotated.`
`56`	`57`	`if (num[low] > num [mid]){`