Commit 10293f7

committed

modified Find Minimum in Rotated Sorted Array

1 parent 0587d00 commit 10293f7Copy full SHA for 10293f7

File tree

-3

lines changed

-3

lines changed

Lines changed: 8 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,16 +1,21 @@`
`1`	`1`	`from typing import List`
`2`	`2`
	`3`	`+`
`3`	`4`	`class Solution:`
`4`	`5`	`def findMin(self, nums: List[int]) -> int:`
`5`	`6`	`for i in range(len(nums)):`
`6`	`7`	`j = i+1 if i < len(nums)-1 else 0`
`7`	`8`	`if nums[i] >= nums[j]:`
`8`	`9`	`return nums[j]`
`9`		`-`
	`10`	`+ # for i in range(len(nums)):`
	`11`	`+ # if i+1 < len(nums) and nums[i] > nums[i+1]:`
	`12`	`+ # return nums[i+1]`
	`13`	`+ # elif i+1 == len(nums):`
	`14`	`+ # return nums[0]`
`10`	`15`
`11`	`16`
`12`	`17`	`# test driver`
`13`	`18`	`sol = Solution()`
`14`		`-nums = [3,4,5,1,2]`
	`19`	`+nums = [3,4, 5, 1, 2]`
`15`	`20`	`print("Input:", nums)`
`16`		`-print("Output:", sol.findMin(nums))`
	`21`	`+print("Output:", sol.findMin(nums))`

Comments

(0)