二叉树定义一个二叉树class Note: def __init__(self, value=None, left=None, right=None): self.value = value self.left = left self.right = right

中序遍历中序遍历有三种写法，递归、迭代和merris递归迭代merris

思路遍历字符串，然后每个子串中判断是否长度一致class Solution: def lengthOfLongestSubstring(self, s: str) -> int: if len(s) <= 1: return len(s) result_max = 0 for i in range(0, len(s)): j = 0 while i + j + 1

两种遍历方式广度优先遍历和深度优先遍历，都可用递归和非递归实现定义二叉树class Node: def __init__(self, root): self.root = root self.left = None self.right = None递归# breadth-first-traversal# pre-order# mid-order# post-...

本文由浅入深介绍递归，分为初中高级分别对待面试情形定义递归如果方法自己调用自己就是递归初级第一题：斐波那契数列fibonaccidef fib(n): if n <=1: return n else: return fib(n-1) + fib(n-2)...

链表由浅入深初级class Node: def __init__(self, val): self.val = val self.next = Noneclass

常用数据结构链表数组

五大常用算法分治动态规划贪婪回溯分支界限