lintcode/ leetcode刷题笔记
Introduction
Dynamic Programming
Backpack
Backpack I
Backpack II
Backpack III
Backpack IV
Backpack V
Backpack VI
K Sum
Minimum Adjustment Cost
Coins in a Line
Coins in a Line II
Coins in a Line III
House Robber
House Robber II
House Robber III
Paint House
Paint House II
Subarray Sum
Subarray Sum
Subarray Sum Closest
Submatrix Sum
Submatrix Sum II
Maximum Subarray
Minimum Subarray
Maximum Subarray II
Maximum Subarray III
Continuous Subarray Sum
Continuous Subarray Sum II
Minimum Size Subarray Sum
Maximum Product Subarray
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV
Maximal Square
Longest Common Subsequence
Longest Common Substring
Longest Increasing Subsequence
Longest Increasing Continuous Subsequence
Longest Palindromic Substring
Edit Distance
Edit Distance II
Dungeon Game
Russian Doll Envelopes
Largest Divisible Subset
Distinct Subsequences
Interleaving String
Follow Up Questions
Iterator Problem
Flatten List
Flatten Nested List Iterator
Flatten 2D Vector
Binary Search Tree Iterator
Flatten Binary Tree to Linked List
Sorting and Searching
Quick Partition
Kth Largest Element
Wiggle Sort
Wiggle Sort II
Nuts & Bolts Problem
Merge Sort
Binary Search
Copy Books
Bucket Sort
Maximum Gap
Mutual Friend
BFS & DFS
Backtracking
Subsets
Subsets II
Permutations
PermutationsII
Palindrome Permutation
Palindrome Permutation II
Print Numbers By Recursion
Palindrome Partitioning
Palindrome Partitioning II
Word Ladder I
Word Ladder II
Data Structure
String
Compare Strings
Two Strings Are Anagrams
Rotate String
Array
Rotate Image
Set Matrix Zeros
Matrix ZigZag Traversal
Linked List
Rotate List
Insertion Sort List
Stack
Max Tree
Expression Tree Build
Expression Evaluation
Largest Rectangle in Histogram
Maximal Rectangle
Min Stack
Queue
Priority Queue
Meeting Rooms
Meeting Room II
Kth Smallest Number in Sorted Matrix
Median
Median of Two Sorted Arrays
Data Stream Median
Sliding Window Maximum
Sliding Window Matrix Maximum
Sliding Window Median
Building Outline
Tree
Graph
Topological Sort
Find the smallest positive number missing from an unsorted array
Other
Permutations
Permutation Sequence
Permutation Index
Permutation Index II
Next Permutation
Singleton
Powered by
GitBook
Subarray Sum
Prefix
dp， 以是否包含第i个元素得到状态方程
results matching "
"
No results matching "
"