Pointcut 是指那些方法需要被执行"AOP",是由"Pointcut Expression"来描述的.Pointcut可以有下列方式来定义或者通过&& || 和!的方式进行组合.args()@args()execution()this()target()@target()within()@wi...
分类：
其他好文 时间：
2014-09-09 15:36:58
阅读次数：
350
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.思路： 1 class Solution { 2 public: 3 strin...
分类：
其他好文 时间：
2014-09-07 17:13:15
阅读次数：
199
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.思路：从后往前遍历，如果某个数比其后一个数小，则减去该数；否则，加上该数。因为只存在Ⅳ(...
分类：
其他好文 时间：
2014-09-07 15:58:25
阅读次数：
242
题目链接：点击打开链接
题意：
有n个任务 m个限制条件
1、task i starts at least A minutes later than task j
表示 i - j >= A
2、task i starts within A minutes of the starting time of task j
表示 i - j
问：每个任务开始的时间。 求一个任意解
...
分类：
其他好文 时间：
2014-09-05 23:47:42
阅读次数：
230
In this article I'll discuss the most fundamental technique in concurrent programming known as memory barriers, or fences, that make
the memory state within a processor visible to other processors.
...
分类：
其他好文 时间：
2014-09-02 12:29:24
阅读次数：
266
Balls are getting more and more popular in the operating room. They act as cushions for chairs and beds in the long effort to the client comfortable a...
分类：
其他好文 时间：
2014-09-01 12:09:23
阅读次数：
240
1,Project are organizational units in the cloud,and are also known as tenants or accounts.Each user is a member of one or more projects.Within a proje...
分类：
其他好文 时间：
2014-08-31 21:20:43
阅读次数：
249
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?2,1,?3,4,?1,2,1,...
分类：
其他好文 时间：
2014-08-31 15:49:11
阅读次数：
180
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?2,1,?3,4,?1,2,1,...
分类：
其他好文 时间：
2014-08-29 01:18:46
阅读次数：
187
Sql starts to execute slowly, because long sql executions block many other sqls.Check approach:There are reports that can be generated from within man...
分类：
数据库 时间：
2014-08-27 14:30:47
阅读次数：
471
