题目：Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECOD...
1.yum安装php yum install php2.配置 apache 支持 php a.找到httpd.conf find / -name httpd.conf b.编辑 httpd.conf vi httpd.conf c.找到 AddType application/x-gzip ...
分类：
Web程序 时间：
2015-06-08 16:37:36
阅读次数：
144
problems:Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and...
分类：
其他好文 时间：
2015-06-08 16:35:07
阅读次数：
119
classBinaryFind{
publicintfind(intleftIndex,intrightIndex,intval,intarr[]){
intmidIndex=(leftIndex+rightIndex)/2;
if(rightIndex>=leftIndex){
if(arr[minIndex]>val){
find(leftIndex,midIndex-1,val,arr);
returnmidIndex;
}elseif(arr[minIndex}<val){
find..
分类：
其他好文 时间：
2015-06-08 15:13:06
阅读次数：
88
L216: Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of number...
分类：
其他好文 时间：
2015-06-08 15:03:38
阅读次数：
116
Description
You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given ...
分类：
编程语言 时间：
2015-06-08 15:03:25
阅读次数：
125
http://blog.csdn.net/dm_vincent/article/details/7655764http://baike.baidu.com/link?url=hVNznQ8iLKukcj5K5FH2_FhDm5i-mHw87sOsUqnSnYUVX6unqx4EfzE_4XOwBvH...
分类：
其他好文 时间：
2015-06-08 13:13:48
阅读次数：
106
Problems:Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = n...
分类：
其他好文 时间：
2015-06-08 12:58:28
阅读次数：
119
//onchange事件
$("._numberbox").numberbox({
????onChange:function(newValue,oldValue)
????{......}
)}
//键盘事件
?var?inputs?=?$("#flcs_table").find(‘input:visible.easyui-numberbox‘);
?...
分类：
其他好文 时间：
2015-06-08 11:48:46
阅读次数：
129
