Spring Proxying Mechanisms_Spring代理机制 来自：/current/spring-framework-reference4.1.1 Spring AOP uses either JDK dynamic proxies or CGLIB to create the proxy for a given target object. (JDK dyna...
分类：
编程语言 时间：
2014-11-05 13:14:40
阅读次数：
193
Consider N coins aligned in a row. Each coin is showing either heads or tails. The adjacency of these coins is the number of adjacent pairs of coins with the same side facing up.
It must return the...
分类：
其他好文 时间：
2014-11-05 10:57:41
阅读次数：
2365
题目描述：
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...
分类：
其他好文 时间：
2014-11-04 17:30:56
阅读次数：
194
You 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 ways can you climb...
分类：
其他好文 时间：
2014-11-03 14:21:20
阅读次数：
145
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?
每一次你可以爬一层或者两层，计算爬n层你...
分类：
其他好文 时间：
2014-10-30 00:24:42
阅读次数：
202
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-29 22:21:11
阅读次数：
175
??
Abstract classes are closely related to interfaces. They are classes that cannot be instantiated, and are frequently either partially implemented, or not at all implemented. One key difference bet...
You 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 ways can you climb...
分类：
其他好文 时间：
2014-10-29 12:48:28
阅读次数：
170
When working with variables that contain strings or numbers. There's often a need to join their values. Either to display directly on screen or to sto...
分类：
其他好文 时间：
2014-10-28 13:37:01
阅读次数：
178
题目描述：
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?
思路:斐波那契数列的应用。f(n)=f...
分类：
其他好文 时间：
2014-10-28 12:13:05
阅读次数：
211
