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
Maximum Depth of Binary Tree
Balanced Binary Tree
Binary Tree Preorder Traversal
Binary Tree Inorder Traversal
Binary Tree Postorder Traversal
Binary Tree Level Order Traversal
Flatten Binary Tree To Linked List
Convert Binary Search Tree to Doubly Linked List
Minimum Depth of Binary Tree
Invert Binary Tree
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
Count of smaller Number
Closest Number in Sorted Array
Last Position of Target
Search a 2D Maxtrix
binary search based on position-- xxoo model
Find Peak Element
Find Minimum in Rotated Sorted Array
Smallest Rectangle Enclosing Black Pixels
Search in a Big Sorted Array
Search a 2D Matrix
Search a 2D Matrix II
Search for a Range
Total Occurrence of Target
Binary Serach ---- Keep half, Drop half
Maximum Number in Mountain Sequence
Search in Rotated Sorted Array
Drop Eggs
K Closest Numbers In Sorted Array
Binary Search In the Answer--- Highest Level Binary Search
binary search on answer
Find Peak Element II
Copy Books
Maximum Average Subarray
Longest Increasing Substring
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
Subsets
Subsets II
permutation
permuation II
N-Queens
String
strStr
BFS
Number of Islands
Topological Sort
Topological Sorting
Course Schedule
Course Schedule II
Graph
Search Graph Nodes
Graph Valid Node
Clone Graph
Six Degree
Matrix
Zombie in Matrix
Build Post Office II
Hidden Graph Problems
Word ladder
Word ladder II
Remove Substrings
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
Word Break
Paint House
Decode ways
Dynamic Programming 坐标型
Longest Increasing Continuous Subsequence
Unique Paths II
Mininum Path Sum
Counting Bits
Paint House 2
Dynamic Programming 序列
Best Time to Buy and Sell Stock IV
Dynamic Programming 背包
Backpack
Backpack V
Backpack VI
Backpack II
Backpack III
Backpack IV
k sum
Minimum Adjustment Cost
Dynamic Programming 区间型
Langest Palindrome subsequence
Coins in a Line III
Stone Game
Stone Game II
Scramble String
Burst Bulloon
Dynamic Programming 划分型
Perfect Squares
Palindrome Partitioning II
Copy Books
Copy Books II
Post Office Problem
Dynamic Programming 双序列
k Edit Distance
Interleaving string
Unique Binary Search Trees
Maximum Average Subarray
Dynamic Programming 博弈
Coins In a line III
MemorySearch
Longest Increasing Continuous SubSequence
Linked List
Insert into a Cyclic Sorted List
Merge Two Sorted Lists
Subarray Sum
Reverse Nodes In k Group
Sort List
Copy List with Random Pointer
Linked List Cycle
Partition List
Linked List Cycle II
Reverse Linked List II
Rotate List
Swap Two Nodes in Linked List
Arrays
Median of Two Sorted Arrays
Subarray Sum
Maximum Subarray
Intersection of Two Arrays
Intersection of Two Arrays II
submatrix sum
Continuous Subarray Sum II
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
two sum
Two Sum - Less than or equal to target
Triangle Count
Trapping Rain Water
Sort
Kth Smallest Numbers in Unsorted Array
DataStructure
UnionFind
Number Of Island
Connecting Graph
Connecting Graph II
Connecting Graph III
Graph Valid Tree
Find the Weak Connected Component in the Directed Graph
Connected Component in Undirected Graph
Surrounded Region
Trie
Implement Trie
Add and Search Word
Word Search II
Word Squares
K Edit Distance
Segment Tree
Segment Tree Build
Segment Tree Query
Segment Tree Modify
Segment Tree Build II
Segment Tree Query II
Interval Sum
Interval Minimum Number
Count of Smaller Number
Interval Sum II
Count of Smaller Number before itself
Stack
Min Stack
Implement Queue by two Stacks
Expand Expression
Largest Rectangle in Histogram
Max Tree
Maximal Rectangle
Expression Tree Build
Convert Expression to Polish Notation
Convert Expression to Reverse Polish Notation
Expression Evaluation
subset non - recursion
permutation non - recursion
Deque
Sliding Window Maximum
Heap
Kth Smallest Number in Sorted Matrix
Kth Smallest Sum In Two Sorted Arrays
Trapping Rain Water II
Sliding Windwo Median
Data Stream Median
Building Outline
Merge K Sorted List
Subarray
Subarray Sum II
Maximum Subarray
Iterators
Flatten Nested List
Flatten 2D Vector
Zigzag Iterator
Zigzag Iterator II
Binary Search Tree Iterator
Follow up
Build Post Office
Build Post Office II
Sliding Windwo Maximum
Max Gap
Path
minimum/maximum path
Minimum Risk Path
Powered by
GitBook
binary search on answer
二分答案类题目
特点
可以用枚举法举出一个范围
这个范围中存在点使得左边所有点和右边所有点不同
注意时间复杂度是nlog（答案范围）
results matching "
"
No results matching "
"