- 博客(2)
- 收藏
- 关注
RSS订阅原创 leetcode70
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 climb to the top? Note: Given n will be a posi
2017-03-23 20:27:47
207
原创 leetcode198
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house
2017-03-23 20:21:00
286
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人