leetcode 231\235\236

最新推荐文章于 2024-09-27 15:30:00 发布

Riccca

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量89

点赞数

分类专栏： python leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/Riccca/article/details/113243531

版权

leetcode 同时被 2 个专栏收录

17 篇文章 0 订阅

订阅专栏

python

16 篇文章 0 订阅

订阅专栏

231 2的幂

# method 1
 class Solution:
     def isPowerOfTwo(self, n: int) -> bool:
         if n == 0:
             return False
         while n%2 == 0:
             n /= 2
         return n==1


# method 2 位运算
# 若该数为2的幂次方，则该数的二进制只有一个1，后面都是0，例如000100，000010，所以利用x&(-x)可以保留最右边的一位1
 class Solution:
     def isPowerOfTwo(self, n: int) -> bool:
         if n == 0:
             return False
         return n & (-n) == n

# n&(n-1)去掉最右边的1
class Solution:
    def isPowerOfTwo(self, n: int) -> bool:
        return n>0 and n&(n-1) == 0

235 二叉搜索树的最近公共祖先

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        while (root.val - p.val) * (root.val - q.val )>0:
            if root.val - p.val > 0:
                root = root.left
            else:
                root = root.right
        return root


class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if not root :return None
        p_path = self.getPath(root,p)
        q_path = self.getPath(root,q)

        p_len = len(p_path)
        q_len = len(q_path)
        min_len = min(p_len, q_len)
        for i in range(min_len):
            if p_path[i] == q_path[i]:
                max_index = i
                continue

        return p_path[max_index]


    def getPath(self,root, node):
        node_path = [root]
        while root != node:
            if root.val < node.val:
                root = root.right
                node_path.append(root)
            if root.val > node.val:
                root = root.left
                node_path.append(root)
        return node_path

236 二叉树的最近公共祖先

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#  遇到空值或p或q ，就返回
#  在root.left里面找
#  在root.right里面找
#  如果left里面找到了，right里面没找到，就返回left
#  如果right里面找到了，left里面没找到，就返回right
#  如果left 和 right都找到了，就返回他们的root
class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if (not root) or (root == q) or (root == p):
            return root
        left = self.lowestCommonAncestor(root.left, p, q)
        right = self.lowestCommonAncestor(root.right, p, q)

        if not left and not right: return None
        if not left: return right
        if not right: return left
        if left and right: return root