ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Climbing Stairshistorical

    Count the ways to climb stairs using a Fibonacci recurrence.

    leetcode / 数字
  2. Search in Rotated Sorted Arrayhistorical

    LeetCode notes on searching in a rotated sorted array.

    leetcode / 数组 / 二分
  3. Search in Rotated Sorted Arrayhistorical

    LeetCode notes on searching in a rotated sorted array.

    leetcode / 数组 / 二分 / 旋转
  4. Merge Two Sorted Arrayshistorical

    Merge two sorted integer arrays into one sorted array.

    leetcode / 数组 / 排序
  5. Find Peak Elementhistorical

    LeetCode notes on the Find Peak Element problem.

    leetcode / 数组 / 二分 / 旋转
  6. Find the K-th Largesthistorical

    Find the K-th largest element in an array using sorting or quicksort partitioning.

    leetcode / 数组 / 排序
  7. Binary Searchhistorical

    Use binary search to find a target value in a sorted ascending integer array.

    leetcode / 数组 / 二分
  8. Find Minimum in Rotated Sorted Arrayhistorical

    LeetCode notes on finding the minimum in a rotated sorted array.

    leetcode / 数组 / 二分 / 旋转
  9. Square Roothistorical

    LeetCode notes on computing an integer square root.

    leetcode / 数组 / 二分
  10. Spiral Matrixhistorical

    Traverse a matrix in clockwise spiral order.

    leetcode / 数组