ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Reverse Linked Listhistorical

    Record stack-based and three-pointer implementations for reversing a singly linked list.

    剑指offer / 链表
  2. Merge Intervalshistorical

    LeetCode notes on merging overlapping intervals.

    leetcode / 数组 / 栈
  3. Min Stackhistorical

    LeetCode notes on implementing a stack that retrieves the minimum element in constant time.

    leetcode / 数组 / 栈
  4. Merge Two Sorted Linked Listshistorical

    Record iterative and recursive implementations for merging two sorted linked lists.

    剑指offer / 链表
  5. Sort an Arrayhistorical

    LeetCode notes on sorting an array with merge sort and quicksort.

    leetcode / 数组 / 排序
  6. K-th Node from the End of a Linked Listhistorical

    Record array, length-conversion, and fast-slow-pointer methods for finding the k-th node from the end.

    剑指offer / 链表
  7. Median of Two Sorted Arrayshistorical

    LeetCode notes on finding the median of two sorted arrays by merging them.

    leetcode / 数组 / 排序
  8. Jump Gamehistorical

    LeetCode notes on the Jump Game problem.

    leetcode / 数组
  9. Copy Complex Linked Listhistorical

    Record the method of copying a complex linked list by inserting copied nodes after the original nodes.

    剑指offer / 链表
  10. Shortest Unsorted Continuous Subarrayhistorical

    LeetCode notes on finding the shortest continuous subarray that must be sorted.

    leetcode / 数组 / 排序