ThinkerQAQ

Data Structures & Algorithms

237 notes

Some notes are currently available only in Chinese. English translations are shown when available.

  1. Reconstruct Binary Treehistorical

    Record the recursive method for reconstructing a binary tree from preorder and inorder traversal results.

    剑指offer / 树
  2. House Robber IIIhistorical

    LeetCode notes on House Robber III using DFS and memoization.

    leetcode / 树 / 先序遍历
  3. Paths in a Binary Tree With a Given Sumhistorical

    Record the depth-first, preorder traversal, and backtracking method for finding binary-tree paths with a given sum.

    剑指offer / 树
  4. Sum Root to Leaf Numbershistorical

    LeetCode notes on summing all numbers formed by root-to-leaf paths.

    leetcode / 树 / 先序遍历
  5. Serialize a Binary Treehistorical

    Record methods for serializing and deserializing a binary tree using preorder traversal and a preorder-plus-inorder traversal combination.

    剑指offer / 树
  6. Invert Binary Treehistorical

    LeetCode notes on Invert Binary Tree.

    leetcode / 树 / 先序遍历
  7. Convert a String to an Integerhistorical

    Record character parsing and atoi implementations for converting a string to an integer.

    剑指offer / 字符串
  8. Path Sum IIIhistorical

    LeetCode notes on Path Sum III.

    leetcode / 树 / 先序遍历
  9. Reverse Word Orderhistorical

    Record methods for reversing word order by splitting the string and by reversing twice.

    剑指offer / 字符串
  10. Maximum Depth of Binary Treehistorical

    LeetCode notes on Maximum Depth of Binary Tree.

    leetcode / 树 / 后序遍历