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

preview_player
Показать описание
April LeetCoding Challenge 2021
Medium
___________________________________________________________________________
Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.
If target is not found in the array, return [-1, -1].
Follow up: Could you write an algorithm with O(log n) runtime complexity?

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]
Example 3: Input: nums = [], target = 0 Output: [-1,-1]
___________________________________________________________________________

#LeetCode #AprilLeetCodingChallenge2021 #Python #34
Рекомендации по теме
visit shbcf.ru