摘要:
要注意边和节点数是不一样的 # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None cl 阅读全文
摘要:
其实暴力也能解,因为就4*4*4*4种 class Solution: def findNext(self, char, nums): i = 0 while i < len(nums): if nums[i] == char: if i != len(nums) - 1: return nums[ 阅读全文