动态规划dynamic programming部分

dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems.

https://www.zhihu.com/question/23995189

不是很理解这个词组的意思，但是它却是3大主力中的其中一个，所以能看出还是非常重要的一个部分

• 题目序号 303、276、256、265、70、53、651、650、647
  • 303. Range Sum Query - Immutable
  • 276. Paint Fence
  • 256. Paint House
  • 265. Paint House II
  • 70. Climbing Stairs
  • 53. Maximum Subarray
  • 651. 4 Keys Keyboard
  • 650. 2 Keys Keyboard
  • 647. Palindromic Substrings
• 题目序号 646、638、576、523、516、494、486、474、467、464
  • 646. Maximum Length of Pair Chain
  • 638. Shopping Offers
  • 576. Out of Boundary Paths
  • 523. Continuous Subarray Sum
  • 516. Longest Palindromic Subsequence
  • 494. Target Sum
  • 486. Predict the Winner
  • 474. Ones and Zeroes
  • 467. Unique Substrings in Wraparound String
  • 464. Can I Win
• 题目序号 418、416、413、392、377、376、375、368、361、357
  • 418. Sentence Screen Fitting
  • 416. Partition Equal Subset Sum
  • 413. Arithmetic Slices
  • 392. Is Subsequence
  • 377. Combination Sum IV
  • 376. Wiggle Subsequence
  • 375. Guess Number Higher or Lower II
  • 368. Largest Divisible Subset
  • 361. Bomb Enemy
  • 357. Count Numbers with Unique Digits
• 题目序号 351、343、338、322、309、304、300、279、264、221
  • 351. Android Unlock Patterns
  • 343. Integer Break
  • 338. Counting Bits
  • 322. Coin Change
  • 309. Best Time to Buy and Sell Stock with Cooldown
  • 304. Range Sum Query 2D - Immutable
  • 300. Longest Increasing Subsequence
  • 279. Perfect Squares
  • 264. Ugly Number II
  • 221. Maximal Square
• 题目序号 213、152、139、120、91、664、518
  • 198. House Robber
  • 213. House Robber II
  • 337. House Robber III
  • 152. Maximum Product Subarray
  • 139. Word Break
  • 120. Triangle
  • 91. Decode Ways
  • 664. Strange Printer
  • 518. Coin Change 2