Sallywa的博客

root是否为none的判断要放在值的判断之前 class Solution: def isSymmetrical(self, pRoot): if pRoot == None: return True return self.helper(pRoot, pRoot) def helper(self, ...

描述 中文English 给一棵二叉树，找到最长连续路径的长度。 这条路径是指 任何的节点序列中的起始节点到树中的任一节点都必须遵循 父-子 联系。最长的连续路径必须是从父亲节点到孩子节点（不能逆序）。 您在真实的面试中是否遇到过这个题？是 题目纠错 样例 样例1: 输入: {1,#,3,2,4,#,#,#,5} 输出:3 说明: 这棵树如图所示 1 \ ...

class Solution: def FindContinuousSequence(self, tsum): if tsum < 3: return [] if tsum == 3: ...

class Solution: def FindNumbersWithSum(self, array, tsum): if len(array) == 0: return [] if ...

递归： def jumpFloor(number): if number <= 2: return number return jumpFloor(number - 2) + jumpFloor(number - 1) 动态规划 def jumpFLoor(number): dp = [0] * (number + 1) if ...

class Solution: def MoreThanHalfNum_Solution(self, numbers): left, right = 0, len(numbers) - 1 index = self.helper(numbers, left, right) mid = int(len(numbers) / 2) ...

# -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: # 返回对应节点TreeNode def Kth...

""" Definition of TreeNode: class TreeNode: def __init__(self, val): self.val = val self.left, self.right = None, None """ class Solution: def serialize(self, root): ...

class Solution: def LastRemaining_Solution(self, n, m): if n == 1 or m == 0: return -1 arr = [] for i in range(n): arr.append(i) index =...

class Solution(object): def detectCycle(self, head): if head == None: return None fast, slow = head, head while fast != None: if fast.next and s...

""" Definition of ListNode class ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next """ class Solution: """ @param head: head is the...

class Solution: def GetNext(self, node): if node == None: return None if node.right: node = node.right while node.left: node...

class Solution: """ @param array: the input array @return: the sorted array """ def multiSort(self, array): self.quickSort(array, 0, len(array) - 1, 1, False) left...