simonzoo / leetcode Goto Github PK

class Solution:
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        lo, hi = 0, len(nums)-1
        while lo <= hi:
            mid = lo + (hi-lo)//2
            if nums[mid] < target:
                lo = mid + 1
            elif nums[mid] > target:
                hi = mid - 1
            else:
                return mid
        return -1

class Solution:
    def mySqrt(self, x):
        """
        :type x: int
        :rtype: int
        """
        lo, hi = 0, x
        while lo < hi:
            mid = hi - (hi-lo)//2
            if mid*mid < x:
                lo = mid
            elif mid*mid > x:
                hi = mid - 1
            else:
                return mid
        return lo