Commit 01cd6d1

committed

add leetcode 34 一行

1 parent 6721b7f commit 01cd6d1Copy full SHA for 01cd6d1

File tree

+13

-0

lines changed

+13

-0

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -415,6 +415,19 @@ class Solution:`
`415`	`415`	`i = (bisect.bisect_left(nums[k:] + nums[:k], target) + k) % max(len(nums), 1)`
`416`	`416`	`return i if nums and nums[i] == target else -1`
`417`	`417`	```
	`418`	`+`
	`419`	`+## [34. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/)`
	`420`	`+`
	`421`	`+- 用自带的bisect函数,一行`
	`422`	`+`
	`423`	+```python3
	`424`	`+class Solution:`
	`425`	`+ def searchRange(self, nums: List[int], target: int) -> List[int]:`
	`426`	`+ # if not nums or target not in nums: return [-1, -1]`
	`427`	`+ return [bisect.bisect_left(nums, target), bisect.bisect_right(nums, target)-1] \`
	`428`	`+ if nums and target in nums else [-1, -1]`
	`429`	+```
	`430`	`+`
`418`	`431`	`## [35. Search Insert Position 1行](https://leetcode.com/problemset/all/?search=35)`
`419`	`432`	```python
`420`	`433`	`class Solution:`

Comments

(0)