Tag: Binary Search
-
LeetCode: 278 First Bad Version
•
LeetCode: 278 First Bad Version You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also…
-
LeetCode: 704 Binary Search
•
Given a sorted (in ascending order) integer array nums of n elements and a target value target, write a function to search target in nums. If target exists, then return its index, otherwise, return -1. Example: Input: nums = [-1, 0, 3, 5, 9, 12], target = 9 Output: 4…