Golang binary search


  • 0
    R
    func findMin(nums []int) int {
        l, r := 0, len(nums) - 1
            for  l < r {
                mid := l + (r - l) / 2;
                if nums[mid] > nums[r] { 
                    l = mid + 1
                } else {
                    r = mid
                }
            }
            return nums[l]
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.