Binary Search

Binary Search, problem 1 of 7

Binary Search

Easy

LC #704

binary searcharray

Not attempted yet

You're given an array nums of distinct integers sorted in ascending order, and an integer target. Return the index of target in nums, or -1 if it isn't there.

Your algorithm must run in O(log n) time.

Example 1

Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4

Example 2

Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1

Example 3

Input: nums = [5], target = 5
Output: 0

Constraints

  • 1 <= nums.length <= 10^5
  • -10^9 <= nums[i], target <= 10^9
  • All values are distinct and sorted ascending.

Python

Loading draft…

Test results

9 tests available

No results yet

Run tests your code against the examples; Submit runs the hidden tests too.

3 examples, 6 hidden

Run examples, then submit all tests.