mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
44 lines
1.3 KiB
Markdown
Executable File
44 lines
1.3 KiB
Markdown
Executable File
# [704. Binary Search](https://leetcode.com/problems/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]`.
|
||
|
||
|
||
## 题目大意
|
||
|
||
|
||
给定一个 n 个元素有序的（升序）整型数组 nums 和一个目标值 target ，写一个函数搜索 nums 中的 target，如果目标值存在返回下标，否则返回 -1。
|
||
|
||
提示：
|
||
|
||
- 你可以假设 nums 中的所有元素是不重复的。
|
||
- n 将在 [1, 10000]之间。
|
||
- nums 的每个元素都将在 [-9999, 9999]之间。
|
||
|
||
|
||
## 解题思路
|
||
|
||
|
||
- 给出一个数组，要求在数组中搜索等于 target 的元素的下标。如果找到就输出下标，如果找不到输出 -1 。
|
||
- 简单题，二分搜索的裸题。
|