GoLang Solution For LeetCode Problem: Binary Search
Solving Binary Search in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4 Explanation: 9 exists in nums and its index is 4
Input: nums = [-1,0,3,5,9,12], target = 2 Output: -1 Explanation: 2 does not exist in nums so return -1
See the full details of the problem Binary Search at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go