2.4 leetcode 704 Binary Search | Data Structures And Algorithm
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:
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
On this page of the site you can watch the video online 2.4 leetcode 704 Binary Search | Data Structures And Algorithm with a duration of online in good quality, which was uploaded by the user David tech 17 July 2023, share the link with friends and acquaintances, this video has already been watched 43 times on youtube and it was liked by 4 viewers. Enjoy your viewing!
