OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
    • 走格
    • Subsequence
    • Counting Bits
    • 887. Super Egg Drop
    • 674. Longest Continuous Increasing Subsequence
    • Integer Break
    • Catalan Number
    • Count Numbers with Unique Digits
    • 2 Keys Keyboard
    • 背包问题
      • Partition Equal Subset Sum
      • 494. Target Sum
      • Ones and Zeroes
      • Perfect Squares
      • Coin Change
      • Combination Sum IV
      • pre背包
        • House Robber
        • House Robber II
      • Coin Change 2
      • 630. Course Schedule III
      • 920. Number of Music Playlists
      • 1235. Maximum Profit in Job Scheduling
      • 1262. Greatest Sum Divisible by Three
    • DFS + Memorization
    • Palindromic Strings
    • 多状态DP
    • f长度与input array长度无关
    • 多指针
    • Partition
    • Subarray Sum
    • String Match
    • Game Theory
    • Flip String to Monotone Increasing
    • 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
    • Maximum Rectangle
    • 1513. Number of Substrings With Only 1s
    • 哈密顿图
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page
  1. Dynamic Programming I
  2. 背包问题

pre背包

House RobberHouse Robber II
PreviousCombination Sum IVNextHouse Robber

Last updated 6 years ago

Was this helpful?

Was this helpful?