ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Entry Node of a Loop in a Linked Listhistorical

    Record set-based and fast/slow-pointer methods for finding the entry node of a linked-list cycle.

    剑指offer / 链表
  2. Best Time to Buy and Sell Stockhistorical

    LeetCode notes on maximizing profit from one stock transaction.

    leetcode / 数组
  3. First Common Node of Two Linked Listshistorical

    Record a two-pointer method that uses the length difference to find the first common node of two linked lists.

    剑指offer / 链表
  4. Rotate Imagehistorical

    LeetCode notes on rotating an n x n matrix 90 degrees clockwise.

    leetcode / 数组
  5. Delete Duplicate Nodes in a Linked Listhistorical

    Record counting- and set-based methods for deleting all duplicate nodes from a sorted linked list.

    剑指offer / 链表
  6. Implement Trie (Prefix Tree)historical

    LeetCode notes on implementing a Trie prefix tree.

    leetcode / 树 / Trie树
  7. Postorder Traversal Sequence of a Binary Search Treehistorical

    Record a recursive method for determining whether a sequence is the postorder traversal result of a binary search tree.

    剑指offer / 树
  8. Unique Binary Search Treeshistorical

    LeetCode notes on counting unique binary search trees with DFS, memoization, and dynamic programming.

    leetcode / 树 / 中序遍历
  9. Next Node in a Binary Treehistorical

    Record methods for finding the inorder successor of a binary-tree node through a full inorder traversal or parent-pointer relationships.

    剑指offer / 树
  10. Binary Tree Inorder Traversalhistorical

    LeetCode notes on binary tree inorder traversal with recursion and color marking.

    leetcode / 树 / 中序遍历