Algorithm Notes
Ctrlk
  • Introduction
  • 开头
  • Binary Search & O(logN)
  • 数值类
  • Binary Tree
  • Linked List
  • Two Pointers 双指针/滑动窗口/Two Sum
  • Breadth First Search 宽度优先搜索
  • DFS - Combination Based
  • Greedy 贪心
  • Bit Manipulation 位运算
  • DFS - Permutation Based and Graph Based
  • Dynamic Programming 动态规划
  • Knapsack / Backpack 背包问题
  • Stack Queue Hash Heap - Data Structure
  • Array Matrix Interval Binary-indexed-tree
  • Segment Tree
  • Trie 字典树
  • Union Find
  • Basic Calculator (Series 1 ~ 4)
  • 灌水类
    • Trapping Rain Water
    • Trapping Rain Water II
    • Container With Most Water
    • Swim in Rising Water
  • 其它类
  • 经典算法和数据结构
  • 较难的算法
  • 其他知识点
  • Python知识点
  • Java知识点
  • C++知识点
  • System Design
  • LeetCode Weekly Contest 81
  • LintCode Weekly Mock Interview 15 (For Amazon Onsite)
  • LintCode Quarter Contest 2018-04-27
  • LeetCode Weekly Contest 82
  • LintCode Weekly Mock Interview 16 (For Facebook Onsite)
  • LeetCode Weekly Contest 83
  • LintCode Weekly Mock Interview 17 (For Google Onsite)
  • LeetCode Weekly Contest 84
  • LintCode Weekly Mock Interview 18
  • LeetCode Weekly Contest 85
  • LintCode Weekly Mock Interview 19 (For Twitter Onsite)
  • LeetCode Weekly Contest 86
  • LintCode Weekly 20 (For Hulu Onsite)
  • LeetCode Weekly 87
  • LintCode Weekly 22
  • LeetCode Weekly 89
  • LintCode Weekly 23
  • LeetCode Weekly 90
  • LintCode Weekly 25
  • LeetCode Weekly 92
  • LintCode Weekly 26
  • LeetCode Weekly 93
  • LintCode Weekly 27
  • LeetCode Weekly 94
  • LintCode Weekly 28
  • LeetCode Weekly 95
  • LintCode Weekly 29
  • LeetCode Weekly 96
  • LintCode Weekly 30
  • LeetCode Weekly 97
  • LintCode Weekly 31
  • LeetCode Weekly 98
  • LintCode Weekly 32
  • LeetCode Weekly 99
  • LeetCode Weekly 104
  • LeetCode Weekly 120
  • LeetCode Weekly 130
Powered by GitBook
On this page

Was this helpful?

灌水类

Trapping Rain WaterTrapping Rain Water IIContainer With Most WaterSwim in Rising Water
PreviousBasic Calculator IVNextTrapping Rain Water

Last updated 5 years ago

Was this helpful?