Climbing StairsYou are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct way...
分类：
其他好文 时间：
2014-10-15 19:24:01
阅读次数：
168
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the ...
分类：
其他好文 时间：
2014-10-15 16:02:10
阅读次数：
190
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at...
分类：
其他好文 时间：
2014-10-15 15:13:00
阅读次数：
200
A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ...
分类：
其他好文 时间：
2014-10-15 01:41:29
阅读次数：
266
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?
//第一种解法
class Solution {
pub...
分类：
其他好文 时间：
2014-10-13 23:41:27
阅读次数：
393
1.一下是几种形式的函数调用：各种调用的效率：在这编文章中有谈到：http://suqing.iteye.com/blog/1981591// Either of the following two patterns can be used to immediately invoke// a fun...
分类：
编程语言 时间：
2014-10-13 14:43:09
阅读次数：
317
eclipse主题 更改Color Theme http://eclipsecolorthemes.org/下载color theme。 Each theme can be downloaded in two formats, *.xml and *.epf. You can either install the Eclipse Color Theme plugin and ...
分类：
系统相关 时间：
2014-10-11 14:01:26
阅读次数：
266
Problem Description
A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most impor...
分类：
其他好文 时间：
2014-10-09 16:32:58
阅读次数：
176
Caused by: org.hibernate.InvalidMappingException: Unable to read XML at org.hibernate.util.xml.MappingReader.readMappingDocument(MappingReader.java:10...
分类：
其他好文 时间：
2014-10-09 13:58:03
阅读次数：
353
[leetccode]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?...
分类：
其他好文 时间：
2014-10-08 11:29:55
阅读次数：
193
