modified Find Minimum in Rotated Sorted Array

Author: minhyeong-joe

Array/FindMinInRotatedSortedArray/solution.py

@@ -1,16 +1,21 @@
 from typing import List
 
+
 class Solution:
     def findMin(self, nums: List[int]) -> int:
         for i in range(len(nums)):
             j = i+1 if i < len(nums)-1 else 0
             if nums[i] >= nums[j]:
                 return nums[j]
-
+        # for i in range(len(nums)):
+        #     if i+1 < len(nums) and nums[i] > nums[i+1]:
+        #         return nums[i+1]
+        #     elif i+1 == len(nums):
+        #         return nums[0]
 
 
 # test driver
 sol = Solution()
-nums = [3,4,5,1,2]
+nums = [3, 4, 5, 1, 2]
 print("Input:", nums)
-print("Output:", sol.findMin(nums))
+print("Output:", sol.findMin(nums))