0704-binary-search.adoc

704. Binary Search

{leetcode}/problems/binary-search/[LeetCode - Binary Search^]

Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, then return its index, otherwise return -1.

Example 1:

Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4

Example 2:

Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1

Note:

1. You may assume that all elements in nums are unique.

2. n will be in the range [1, 10000].

3. The value of each element in nums will be in the range [-9999, 9999].

思路分析

二分查找

一刷

link:{sourcedir}/_0704_BinarySearch.java[role=include]

二刷

link:{sourcedir}/_0704_BinarySearch_2.java[role=include]

参考资料

1. 704. 二分查找 - 画解算法

2. 704. 二分查找 - 清晰图解

3. Binary Vs Linear Search Animated Gifs — 非常优美的动图