📖
📖
📖
📖
LeetCode
Search
⌃
K
📖
📖
📖
📖
LeetCode
Search
⌃
K
Introduction
Array
Basic Knowledge
Binary Search
Binary Tree
Bit
Data Structure
Divide Conquer
Dynamic Programming
1.position
2.sequence
Backpack Problem
1155.Number-of-Dice-Rolls-With-Target-Sum
322.Coin-Change
416.Partition-Equal-Subset-Sum
Backpack Ii
Backpack Iii
Backpack
区间型
矩阵坐标
1049.Last-Stone-Weight-II
1140.Stone-Game-II
1235.Maximum-Profit-in-Job-Scheduling
1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers
1406.Stone-Game-III
774.Minimize-Max-Distance-to-Gas-Station
Longest Arithmetic Sequence
Graph Search
Linked List
Matrix
Mergesort
Numbers
Other
Permutation And Combination
Queue
Sort Algorithm
Stack
String
Toposort
Trie Tree
Two Pointers
Union Find
Powered By
GitBook
Comment on page
Backpack Problem
Here are the articles in this section:
1155.Number-of-Dice-Rolls-With-Target-Sum
322.Coin-Change
416.Partition-Equal-Subset-Sum
Backpack Ii
Backpack Iii
Backpack
Previous
Minimum Adjustment Cost
Next
1155.Number-of-Dice-Rolls-With-Target-Sum
Last modified
2yr ago