Algorithms-notes
Introduction
- Sort
Binary Tree
- Structure Modification
  - Remove Node in Binary Search Tree
  - Binary Tree Serialization
- Divide and Conquer
  - Binary Tree Path Sum
  - Binary Tree Path Sum II
  - Binary Tree Maximum Path Sum
  - Binary Tree Maximum Path Sum II
  - Lowest Common Ancestor
  - Lowest Common Ancestor ii
  - Lowest Common Ancestor iii
  - Subtree with Maximum Average
  - Minimum Subtree
  - Binary Tree Longest Consecutive Sequence
  - Binary Tree Longest Consecutive Sequence II
  - Binary Tree Longest Consecutive Sequence III
  - Binary Tree Path Sum II
  - Binary Tree Maximum Node
  - Subtree
- Traversal
- Binary Tree Path (subsets templates)
  - Binary Tree Paths
  - Binary Tree Path Sum
- breadth first Search
  - Convert Binary Tree to Linked Lists by Depth
- Convert Between Other and Binary Tree
  - Convert Sorted Array to Binary Search Tree With Minimal Height
Binary Search
Segment Tree
- Segment Tree Build
- Segment Tree Query
- Segment Tree Query II
- Segment Tree Build II
- Segment Tree Modify
- Count of Smaller Number
- Interval Minimum Number
- Interval Sum
- Interval Sum II
- Count of Smaller Number before itself
SubSet and Permutation
String
- strStr
BFS
DFS
- Combination Sum
- Combination Sum II
- Palindrome Partitionint
- Word Break II
- Generate Parentheses
- Letter Combination of a Phone number
- Restore IP Address
- Word Break III
- word search
- Nested List Weight Sum
- House Rubber III
- Route Between Two Nodes in Graph
- word ladder
- Next Permutation
- Previous Permutation
Dynamic Programming
Linked List
Arrays
Amazon Ladder
- Phone Interview I
- Phone Interview II
- On Site I
- On Site II
  - Anagrams
- On Site III
  - Second Max of Array
  - Connection Graph
- On Site IV
  - Reversed Pair
  - LRU Cache
HashFunction
Hash Function
LeetCode
- Contest
  - Number of Atom
Contest
two pointer
- forward moving
  - window
    - Minimum Size Subarray Sum
    - Longest Substring with At Most K Distinct Characters
- moving towards each other
Sort
- Kth Smallest Numbers in Unsorted Array
DataStructure
Heap
Subarray
- Subarray Sum II
- Maximum Subarray
Iterators
Follow up
Path
- minimum/maximum path
  - Minimum Risk Path

Powered by GitBook

Heap

堆的性质

在一个集合中求最大或最小的问题

results matching ""

No results matching ""