Light OJ Dynamic Programming

Free to do the same new

1004-monkey Banana Problem number Tower

1005-rooks arrangement

1013-love Calculator LCS variants

DP[I][J][K] for the number of scenarios where the first string I to Jlcs is K

1068-investigation Digital DP

The remainder of the number dp[i][j][k] to the sum of the digits of each digit of the nth integer and the sum of the number of the numbers can be divided by K is the J current number remainder is K

1079-just another robbery 01 backpack

Total unwilling and the probability of not being scratched for backpack volume for item value

1032-fast Bit Calculations

Two consecutive ' 1 ' occurrences of the binary number and Dp[i][j][k] the first bit of "I" appears J Times ' 11 ' is the last digit 1

1110-an Easy LCS LCS

1140-digit DP

The number of zeros in the total number between two numbers dp[i][j][k] to the first I for the appearance of J valid 0 is not all 0 (k==true)

1231-coin Change (I) group backpack

For each currency with a value of x y, split the y X*1,x*2,x*3...x*y and then pack the backpack.

1232-coin Change (II) Fully backpack

1233-coin Change (III) multiple backpacks

1257-farthest Nodes in a tree (II) diameter

Direct 2-time BFS to find the diameter of the tree

1421-wavio Sequence 2 times 2 points +lis

1422-halloween Costumes Interval DP

DP[L][R] L to r minimum number required

Copyright notice: This article blog original article. Blogs, without consent, may not be reproduced.

Light OJ Dynamic Programming