【LeetCode】 34. Find First and Last Position of Element in Sorted Array (Python)

【LeetCode】 34. Find First and Last Position of Element in Sorted Array (Python)

题目描述

34. Find First and Last Position of Element in Sorted Array

Medium

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm’s runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

Example 1:

Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]

Example 2:

Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]

严谨分析

作为小白的我刷这些，就一个词“懵逼”，这咋返回，要找这个数最多有几个？（我奇怪的关注点）

我学了的查找有：线性、二分、哈希——肯定用二分！我思路清晰的很嘿嘿

二分查找时mid是这个数就返回，现在要俩了，该咋弄？二分分分，我裂开来。

算球了搜答案吧，哈哈哈

一百度，c++的，噢，原来有直接找大于、小于边界的函数呀，不行，我初学，要自己底层慢慢来，严肃脸。

搜下python的，噢，这呀，easy

def写写写，发呆呆，写个锤锤