#递归和动态规划 · 小土刀 5.0

2016-01-09

Climb Stairs

Suppose we have a ladder which has n steps. Each time you can either climb 1 or 2 steps.

2016-01-09

有 n 个不同价值的硬币排成一条线。两个参赛者轮流从右边依次拿走 1 或 2 个硬币，直到没有硬币为止。计算两个人分别拿到的硬币总价值，价值高的人获胜。

2016-01-09

有 n 个硬币排成一条线。两个参赛者轮流从右边依次拿走 1 或 2 个硬币，直到没有硬币为止。拿到最后一枚硬币的人获胜。

2016-01-09

Given a value N, this N means we need to make change for N cents, and we have infinite supply of each of S = {

2016-01-09

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where t

2016-01-09

Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can

2016-01-09

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the cand

2016-01-09

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.

2016-01-09

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai).

2016-01-09

A message containing letters from A-Z is being encoded to numbers using the following mapping: