红黑树刷题（下）

99. 恢复二叉搜索树

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def inorder(self, root):
        if not root: return
        self.inorder(root.left)
        if self.pre and self.pre.val >  root.val:
            if not self.p:
                self.p = self.pre 
            self.q = root
        self.pre = root
        self.inorder(root.right)
    def recoverTree(self, root: Optional[TreeNode]) -> None:
        """
        Do not return anything, modify root in-place instead.
        """
        self.pre = None
        self.p = self.q = None
        self.inorder(root)
        self.p.val, self.q.val = self.q.val, self.p.val
        return root

653. 两数之和 IV - 输入二叉搜索树

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def inorder(self, root, k, ret):
        if not root: return False 
        if self.inorder(root.left, k, ret):
            return True 
        if k - root.val in ret:
            return True 
        ret.add(root.val)
    
        if self.inorder(root.right, k, ret):
            return True
        return False
        
    def findTarget(self, root: Optional[TreeNode], k: int) -> bool:
        ret = set()
        return self.inorder(root, k, ret)

204. 计数质数

class Solution:
    def countPrimes(self, n: int) -> int:
        if n < 2: return 0
        ret = [0] * (n + 1)
        ret[0] = 1 
        ret[1] = 1
        for i in range(n + 1):
            if ret[i] == 1: continue 
            ret[i * i:n:i] = [1] * len(ret[i * i:n:i])
        return sum(1 for i in range(n) if ret[i] == 0)

504. 七进制数

class Solution:
    def convertToBase7(self, num: int) -> str:
        if num == 0: return '0'
        ans = ''
        flag = 0
        if num < 0:
            flag = 1
            num = -num
        while num:
            ans = str(num % 7) + ans
            num //= 7
        return ('-' if flag else '') + ans

461. 汉明距离

528. 按权重随机选择

class Solution:

    def __init__(self, w: List[int]):
        self.pre_sum = w[:]
        for i in range(1, len(w)):
            self.pre_sum[i] += self.pre_sum[i -1]
        self.n = self.pre_sum[-1]

    def pickIndex(self) -> int:
        x = random.randint(1, self.n)
        l, r = 0, len(self.pre_sum) - 1
        while l < r:
            mid = (l + r) // 2
            if self.pre_sum[mid] <= x - 1:
                l = mid + 1
            else: r = mid 
        return l                


# Your Solution object will be instantiated and called as such:
# obj = Solution(w)
# param_1 = obj.pickIndex()