find-first-and-last-position-of-element-in-sorted-array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of integers <code>nums</code> sorted in non-decreasing order, find the starting and ending position of a given <code>target</code> value.

If <code>target</code> is not found in the array, return <code>[-1, -1]</code>.

You must&nbsp;write an algorithm with&nbsp;<code>O(log n)</code> runtime complexity.

&nbsp;
Example 1:
<pre>Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]
</pre>Example 2:
<pre>Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]
</pre>Example 3:
<pre>Input: nums = [], target = 0
Output: [-1,-1]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-109&nbsp;&lt;= nums[i]&nbsp;&lt;= 109</code></li>
	<li><code>nums</code> is a non-decreasing array.</li>
	<li><code>-109&nbsp;&lt;= target&nbsp;&lt;= 109</code></li>
</ul>

searchRange

Find First and Last Position of Element in Sorted Array

First Bad Version

first-bad-version

第一个错误的版本

Plates Between Candles

plates-between-candles

蜡烛之间的盘子

Find Target Indices After Sorting Array

find-target-indices-after-sorting-array

找出数组排序后的目标下标

Array

Binary Search

给你一个按照非递减顺序排列的整数数组 <code>nums</code>，和一个目标值 <code>target</code>。请你找出给定目标值在数组中的开始位置和结束位置。

如果数组中不存在目标值 <code>target</code>，返回&nbsp;<code>[-1, -1]</code>。

你必须设计并实现时间复杂度为&nbsp;<code>O(log n)</code>&nbsp;的算法解决此问题。

&nbsp;

示例 1：

<pre>
输入：nums = [<code>5,7,7,8,8,10]</code>, target = 8
输出：[3,4]</pre>

示例&nbsp;2：

<pre>
输入：nums = [<code>5,7,7,8,8,10]</code>, target = 6
输出：[-1,-1]</pre>

示例 3：

<pre>
输入：nums = [], target = 0
输出：[-1,-1]</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-109&nbsp;&lt;= nums[i]&nbsp;&lt;= 109</code></li>
	<li><code>nums</code>&nbsp;是一个非递减数组</li>
	<li><code>-109&nbsp;&lt;= target&nbsp;&lt;= 109</code></li>
</ul>