704. Two -point search

https://leetcode.cn/leetbook/read/learning-algorithms-with-leetcode/xsshgi/
Not difficult，Just recursive to take a note

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        def recursion(nums, left, right, target):
            if left > right:
                # Recursive end
                return -1
            mid = left + (right - left) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                left = mid + 1
            else:
                right = mid - 1
            return recursion(nums, left, right, target)

        left = 0
        right = len(nums) - 1
        return recursion(nums, left, right, target)

https://leetcode.cn/leetbook/read/learning-algorithms-with-leetcode/xssbke/

# The guess API is already defined for you.
# @param num, your guess
# @return -1 if num is higher than the picked number
#          1 if num is lower than the picked number
#          otherwise return 0
# def guess(num: int) -> int:

class Solution:
        def guessNumber(self, n: int) -> int:
            def recursion(nums, left, right):
                if left > right:
                    # Recursive end
                    return -1
                mid = left + (right - left) // 2
                if guess(mid) == 0:
                    return mid
                elif guess(mid) == 1:
                    left = mid + 1
                else:
                    right = mid - 1
                return recursion(nums, left, right)

            left = 1
            right = n
            return recursion(n, left, right)