We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
给定一个按照升序排列的整数数组 nums ，和一个目标值 target 。找出给定目标值在数组中的开始位置和结束位置。
nums
target
你的算法时间复杂度必须是 O(logn) 级别。
O(logn)
如果数组中不存在目标值，返回 [-1, -1] 。
[-1, -1]
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8 输出: [3,4]
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6 输出: [-1,-1]
附赠leetcode地址：leetcode