ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Stack with a min Functionhistorical

    Record using an auxiliary minimum stack to retrieve the stack minimum in O(1) time.

    剑指offer / 栈
  2. Binary Tree Maximum Path Sumhistorical

    LeetCode notes on Binary Tree Maximum Path Sum.

    leetcode / 树 / 后序遍历
  3. Stack Push and Pop Sequenceshistorical

    Record methods that use an auxiliary stack to determine whether a given sequence is a valid pop sequence.

    剑指offer / 栈
  4. Binary Tree Right Side Viewhistorical

    LeetCode notes on Binary Tree Right Side View.

    leetcode / 树 / 层序遍历
  5. Implement a Queue with Two Stackshistorical

    Record how to implement queue Push, Pop, Peek, and Empty operations using two stacks.

    剑指offer / 栈
  6. Binary Tree Level Order Traversalhistorical

    LeetCode notes on Binary Tree Level Order Traversal.

    leetcode / 树 / 层序遍历
  7. Search in a 2D Arrayhistorical

    Mirror translation of the original Sword Offer note: Search in a 2D Array.

    剑指offer / 数组
  8. Serialize and Deserialize Binary Treehistorical

    LeetCode notes on Serialize and Deserialize Binary Tree.

    leetcode / 树 / 层序遍历
  9. Two Numbers with Sum Shistorical

    Mirror translation of the original Sword Offer note: Two Numbers with Sum S.

    剑指offer / 数组
  10. Binary Tree Zigzag Level Order Traversalhistorical

    LeetCode notes on Binary Tree Zigzag Level Order Traversal.

    leetcode / 树 / 层序遍历