dxx_111的博客

给定不同面额的硬币 coins 和一个总金额 amount。编写一个函数来计算可以凑成总金额所需的最少的硬币个数。如果没有任何一种硬币组合能组成总金额，返回-1。 示例1: 输入: coins = [1, 2, 5], amount = 11 输出: 3 解释: 11 = 5 + 5 + 1 示例 2: 输入: coins = [2], amount = 3 输出: -1 说明:...

Tiling Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8305   Accepted: 4004 Description In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?

数塔 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 28474    Accepted Submission(s): 17119 Problem Description 在讲述DP算法的时候，一个经典的例子就是数塔问

Worm Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3408    Accepted Submission(s): 2195 Problem Description 自从见识了平安夜苹果的涨价后，Lele就在

循环多少次？ Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3827    Accepted Submission(s): 1460 Problem Description   我们知道，在编程中，我们时常需

K - K Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 617B Description Bob loves everything sweet. His favorite chocol