LeetCode
Ctrlk
  • Introduction
  • Design
  • OOD
  • Sort
  • Binary Search
  • Data Structure
  • Graph
  • Traversal
  • Math
  • Sum
  • Parentheses
  • String
  • Greedy
  • Dynamic Programming
    • Palindromic Substring
    • Subarray
    • Backpack problem
      • Backpack I
      • Backpack II
      • Backpack III
      • Backpack IV
      • Backpack V
      • Backpack VI aka: Combination Sum IV
      • Coin Change 2
    • 70. Climbing Stairs
    • 10. Regular Expression Matching
    • 91. Decode Ways
    • 338. Counting Bits
    • 121. Best Time to Buy and Sell Stock
    • 122. Best Time to Buy and Sell Stock II
    • 123. Best Time to Buy and Sell Stock III
    • 139. Word Break
    • 140. Word Break II
    • 198. House Robber
    • 72. Edit Distance
    • 221. Maximal Square
    • 84. Largest Rectangle in Histogram
    • 312. Burst Balloons
    • 304. Range Sum Query 2D - Immutable
    • 518. Coin Change 2
    • Longest Arithmetic Progression
    • 975. Odd Even Jump
    • 1066. Campus Bikes II
  • JingChi.ai
  • Twitter
  • Akuna
  • LintCode Contest
  • SQL
  • FB 19
  • Google 20
  • 818. Race Card
Powered by GitBook
On this page

Was this helpful?

  1. Dynamic Programming

Backpack problem

Source: [LintCode] Backpack I II III IV V VI [背包六问] https://segmentfault.com/a/1190000006325321

Previous152. Maximum Product SubarrayNextBackpack I

Last updated 6 years ago

Was this helpful?