Apply suggestion from @parkhojeong

Co-authored-by: Hojeong Park <parkhj062@gmail.com>

Author: yuseok89

find-minimum-in-rotated-sorted-array/yuseok89.py

@@ -14,7 +14,7 @@ def findMin(self, nums: List[int]) -> int:
             if nums[low] > nums[mid]:
                 high = mid
             else:
-                low = mid
+                low = mid + 1
 
         return min(nums[low], nums[high])