📖
LeetCode
search
Ctrlk
  • Introduction
  • Arraychevron-right
  • Basic Knowledgechevron-right
  • Binary Searchchevron-right
  • Binary Treechevron-right
  • Bitchevron-right
  • Data Structurechevron-right
  • Divide Conquerchevron-right
  • Dynamic Programmingchevron-right
    • 1.positionchevron-right
    • 2.sequencechevron-right
    • Backpack Problemchevron-right
      • 1155.Number-of-Dice-Rolls-With-Target-Sum
      • 322.Coin-Change
      • 416.Partition-Equal-Subset-Sum
      • Backpack Ii
      • Backpack Iii
      • Backpack
    • 区间型chevron-right
    • 矩阵坐标chevron-right
    • 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 Searchchevron-right
  • Linked Listchevron-right
  • Matrixchevron-right
  • Mergesortchevron-right
  • Numberschevron-right
  • Otherchevron-right
  • Permutation And Combinationchevron-right
  • Queuechevron-right
  • Sort Algorithmchevron-right
  • Stackchevron-right
  • Stringchevron-right
  • Toposortchevron-right
  • Trie Treechevron-right
  • Two Pointerschevron-right
  • Union Findchevron-right
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Dynamic Programming

Backpack Problem

1155.Number-of-Dice-Rolls-With-Target-Sumchevron-right322.Coin-Changechevron-right416.Partition-Equal-Subset-Sumchevron-rightBackpack Iichevron-rightBackpack Iiichevron-rightBackpackchevron-right
PreviousMinimum Adjustment Costchevron-leftNext1155.Number-of-Dice-Rolls-With-Target-Sumchevron-right

Last updated 4 years ago

Was this helpful?

Was this helpful?