leetcode-5.18[985. 查询后的偶数和、404. 左叶子之和]（python实现)

题目1

题解1

class Solution:
    def sumEvenAfterQueries(self, A: List[int], queries: List[List[int]]) -> List[int]:
        S = sum(item for item in A if item%2==0)
        sum_even = []
        for item in queries:
            index = item[1]
            # 如果选到该元素，则先剔除
            if A[index]%2==0:
                S -= A[index]
            A[index] += item[0]
            # 如果改变后是偶数，则添加
            if A[index]%2==0:
                S += A[index]
            sum_even.append(S)
        return sum_even

附上题目链接

题目2

题解2

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def sumOfLeftLeaves(self, root: TreeNode) -> int:
        """
            递归
        """
        if root is None:
            return 0
        # 如果存在左叶子节点
        if root and root.left and not root.left.left and not root.left.right:
            return root.left.val + self.sumOfLeftLeaves(root.right)
        # 如果没有左叶子节点，左叶子节点存在于左右子树中
        return self.sumOfLeftLeaves(root.left) + self.sumOfLeftLeaves(root.right)

    def sumOfLeftLeaves(self, root: TreeNode) -> int:
        """
            迭代
        """
        if root is None:
            return 0
        stack = [root]
        num = 0
        while stack:
            node = stack.pop()
            if node and node.left and not node.left.left and not node.left.right:
                num += node.left.val
            if node.left:
                stack.append(node.left)
            if node.right:
                stack.append(node.right)
        return num

附上题目链接