✳flâneur — a map of the web's best reading
Binary Search - LeetCode
leetcode.com · saved by 1 readers
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. You must write an algorithm with O(log n) runtime complexity. Example 1: Example 2: Constraints:
Explore this link on the map →