新星计划，一些做题记录

867. 转置矩阵

class Solution: def transpose(self, matrix: List[List[int]]) -> List[List[int]]: M =[] g_m = len(matrix) i_m = len(matrix[0]) for j in range(0, i_m): m = [] for i in range(0, g_m): m.append(matrix[i][j]) M.append(m) return M

1422. 分割字符串的最大得分 - 力扣（LeetCode）

注意：s.count('1')

class Solution: def maxScore(self, s: str) -> int: len_s = len(s) max = 0 sc_l = 0 num_1 = s.count('1') for i in range(0, len_s-1): if s[i]=='0': sc_l += 1 else: num_1 -= 1 score = sc_l + num_1 if score >= max: max = score return max

2236. 判断根结点是否等于子结点之和 - 力扣（LeetCode）

# 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 checkTree(self, root: Optional[TreeNode]) -> bool: if root.left.val + root.right.val == root.val: return True else: return False

2413. 最小偶倍数 - 力扣（LeetCode）

class Solution: def smallestEvenMultiple(self, n: int) -> int: if n % 2 == 0: return n else: return 2*n