Commita413fa1

authored

Update 153-Find-Minimum-Rotated-Sorted-Array.py

Removed unnecessary code (benefiting from python negative indexing)File(s) Modified: 153-Find-Minimum-Rotated-Sorted-Array.pyLanguage(s) Used: PythonSubmission URL:https://leetcode.com/submissions/detail/844976900/

1 parent82e9776 commita413fa1Copy full SHA for a413fa1

File tree

1 file changed

+15

-13

lines changed

python
- 153-Find-Minimum-in-Rotated-Sorted-Array.py

1 file changed

+15

-13

lines changed

`‎python/153-Find-Minimum-in-Rotated-Sorted-Array.py‎`

Lines changed: 15 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,16 +1,18 @@`
`1`	`1`	`classSolution:`
`2`	`2`	`deffindMin(self,nums:List[int])->int:`
`3`		`-res=nums[0]`
`4`		`-l,r=0,len(nums)-1`
`5`		`-`
`6`		`-whilel<=r:`
`7`		`-ifnums[l]<nums[r]:`
`8`		`-res=min(res,nums[l])`
`9`		`-break`
`10`		`-m= (l+r)//2`
`11`		`-res=min(res,nums[m])`
`12`		`-ifnums[m]>=nums[l]:`
`13`		`-l=m+1`
	`3`	`+start ,end=0 ,len(nums)-1`
	`4`	`+curr_min=float("inf")`
	`5`	`+`
	`6`	`+whilestart<end :`
	`7`	`+mid= (start+end )//2`
	`8`	`+curr_min=min(curr_min,nums[mid])`
	`9`	`+`
	`10`	`+# right has the min`
	`11`	`+ifnums[mid]>nums[end]:`
	`12`	`+start=mid+1`
	`13`	`+`
	`14`	`+# left has the min`
`14`	`15`	`else:`
`15`		`-r=m-1`
`16`		`-returnres`
	`16`	`+end=mid-1`
	`17`	`+`
	`18`	`+returnmin(curr_min,nums[start])`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commita413fa1

File tree

1 file changed

1 file changed

`‎python/153-Find-Minimum-in-Rotated-Sorted-Array.py‎`

0 commit comments