上一页 1 ··· 8 9 10 11 12 13 14 15 16 ··· 37 下一页
摘要: You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that a 阅读全文
posted @ 2019-12-05 01:24 Review->Improve 阅读(125) 评论(0) 推荐(0) 编辑
摘要: Given a linear equation of n variables, find the total number of non-negative integer solutions of it. All coefficients are positive. Example: input: 阅读全文
posted @ 2019-12-04 23:58 Review->Improve 阅读(211) 评论(0) 推荐(0) 编辑
摘要: You are given a series of arithmetic equations as a string, such as: y = x + 1 5 = x + 3 10 = z + y + 2 The equations use addition only and are separa 阅读全文
posted @ 2019-12-04 12:19 Review->Improve 阅读(306) 评论(0) 推荐(0) 编辑
摘要: (This problem is an interactive problem.) On the sea represented by a cartesian plane, each ship is located at an integer point, and each integer poin 阅读全文
posted @ 2019-12-03 00:38 Review->Improve 阅读(1945) 评论(0) 推荐(0) 编辑
摘要: A quack is a data structure combining properties of both stacks and queues. It can be viewed as a list of elements written left to right such that thr 阅读全文
posted @ 2019-11-29 01:43 Review->Improve 阅读(3188) 评论(0) 推荐(0) 编辑
摘要: A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Write a function to count the total strobog 阅读全文
posted @ 2019-11-24 02:41 Review->Improve 阅读(257) 评论(0) 推荐(0) 编辑
摘要: A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Find all strobogrammatic numbers that are o 阅读全文
posted @ 2019-11-24 02:38 Review->Improve 阅读(221) 评论(0) 推荐(0) 编辑
摘要: Dynamic programming solution State: dp[i]: the minimum cost to cover all positions from[0, i]. (left shift by 1 to get 0 index) // if position i is al 阅读全文
posted @ 2019-11-18 08:53 Review->Improve 阅读(500) 评论(0) 推荐(0) 编辑
摘要: Given an array that has n integers, count the number of ways to split all elements of this array into 3 contiguous parts so that the sum of each part 阅读全文
posted @ 2019-10-29 02:10 Review->Improve 阅读(468) 评论(0) 推荐(0) 编辑
摘要: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文
posted @ 2019-10-28 10:23 Review->Improve 阅读(178) 评论(0) 推荐(0) 编辑
上一页 1 ··· 8 9 10 11 12 13 14 15 16 ··· 37 下一页