链接： http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1752
Description
There are n webpages, each of which has its respective page rank. The content is constantly updated ...
分类：
其他好文 时间：
2014-06-09 23:32:22
阅读次数：
270
Now, when you buy food, you will be able to
return home in reusable bags that will not be rejected, which can be used over
and over again, and washed ...
分类：
其他好文 时间：
2014-06-09 18:35:51
阅读次数：
320
These code is for the problem "Let the balloons
Fly" in ACM 1004 which need deal with string.It is a little difficult in some
content so that I rewrit...
分类：
其他好文 时间：
2014-06-09 13:33:35
阅读次数：
266
As a so exciting dream, I would like set up my
owned web site which can be accessed anywhere nomatter from laptop/mobile phone
or tablet. Current now ...
分类：
Web程序 时间：
2014-06-09 13:00:33
阅读次数：
420
字符串和字符A string is an ordered collection of
characters, such as "hello, world" or "albatross". Swift strings are represented
by the String type, which ...
分类：
其他好文 时间：
2014-06-08 19:43:21
阅读次数：
247
今天在某公司（不透露了）写了一套Java面试题。有个题大概是这样的。
Which design patternused in Java.lang.Runtime?
就是说java.lang.Runtime里，用了什么设计模式
还有java.utils.collection里用了什么设计模式。
当时由于对这冷门知识了解的不够多，而且api也读的少，所以一时答不上来。
回到家搜了下。...
分类：
编程语言 时间：
2014-06-08 18:10:17
阅读次数：
547
题目
Given a string S and a string T, count the number of distinct subsequences of T in S.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be...
分类：
其他好文 时间：
2014-06-08 14:49:14
阅读次数：
347
语法概述
下面看一个例子简单过下语法：
例:
sum(sal) over (partition by deptno order by ename) new_alias
sum就是函数名
(sal)是分析函数的参数,每个函数有0~3个参数,参数可以是表达式,例如:sum(sal+comm)
over() 是开窗函数，这是开启分析函数的起点，对于既可作为聚集函数又可作为分析函...
分类：
数据库 时间：
2014-06-08 05:09:07
阅读次数：
329
A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means th...
分类：
其他好文 时间：
2014-06-08 04:05:14
阅读次数：
315
题目：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length...
分类：
其他好文 时间：
2014-06-08 03:06:52
阅读次数：
221
