single-element-in-a-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

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.

Return the single element that appears only once.

Your solution must run in <code>O(log n)</code> time and <code>O(1)</code> space.

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

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 105</code></li>
</ul>

singleNonDuplicate

Single Element in a Sorted Array

Array

Binary Search

给你一个仅由整数组成的有序数组，其中每个元素都会出现两次，唯有一个数只会出现一次。

请你找出并返回只出现一次的那个数。

你设计的解决方案必须满足 <code>O(log n)</code> 时间复杂度和 <code>O(1)</code> 空间复杂度。

&nbsp;

示例 1:

<pre>
输入: nums = [1,1,2,3,3,4,4,8,8]
输出: 2
</pre>

示例 2:

<pre>
输入: nums = [3,3,7,7,10,11,11]
输出: 10
</pre>

&nbsp;

<meta charset="UTF-8" />

提示:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i]&nbsp;&lt;= 105</code></li>
</ul>