My Practice
search
Ctrlk
My Practice
  • Introduction
  • Chapter 1 Combination and Permutation
  • Chapter 2 Binary Search & Sorted Array
  • Chapter 3 Binary Tree
  • Chapter 4 DFS & BFS
  • Chapter 5 Linked List
  • Chapter 6 Dynamic Programming
    • Matrix 类型
    • Sequence 类型
    • Two Sequences 类型
    • Backpack
    • Optimal Solution
    • Problem 198: House Robber
    • Problem 361: Bomb Enemy
    • Problem 279: Perfect Squares
    • Problem 418: Sentence Screen Fitting
    • Optimal Solution
  • Chapter 7 Graph & Search
  • Chapter 8 Data Structure
  • Chapter 9 High Frequency
  • Post Chapter 1 String
  • Post Chapter 2 Math
  • Post Chapter 3 Array
  • Facebook
  • Amazon
  • All Chapters Summary
  • Core Java Interview Questions
  • Basics of Sorting
  • Behavior Questions
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Chapter 6 Dynamic Programming

Matrix 类型chevron-rightSequence 类型chevron-rightTwo Sequences 类型chevron-rightBackpackchevron-rightOptimal Solutionchevron-rightProblem 198: House Robberchevron-rightProblem 361: Bomb Enemychevron-rightProblem 279: Perfect Squareschevron-rightProblem 418: Sentence Screen Fittingchevron-rightOptimal Solutionchevron-right
PreviousProblem 234: Palindrome Linked Listchevron-leftNextMatrix 类型chevron-right

Last updated 6 years ago