【题目】
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 = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BANC".
Note:
If there is no such window in S that covers ...
分类：
其他好文 时间：
2014-06-05 11:14:26
阅读次数：
255
说明第一下：按照前面的方式我们创建了项目，如果使用的是最新的ADT，Minimum Android SDK选的是android2.*或1.*，此时会默认创建一个兼容的项目，——appcompat_v7，这个项目还是不能删除的，删除会报错。。
说明第二下：项目创建好了之后，发现layout文件夹（布局）中会有默认两个文件：adtivity和fragment文件：
1、Fragment概述...
分类：
移动开发 时间：
2014-06-05 10:21:13
阅读次数：
308
【题目】
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 = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BANC".
Note:
If there is no such window in S that covers ...
Given amxngrid filled with non-negative
numbers, find a path from top left to bottom right whichminimizesthe sum of all
numbers along its path.Note:Yo...
分类：
其他好文 时间：
2014-06-04 20:57:08
阅读次数：
360
Given two wordsword1andword2, find the minimum
number of steps required to convertword1toword2. (each operation is counted as 1
step.)You have the fol...
分类：
其他好文 时间：
2014-06-04 20:12:15
阅读次数：
199
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="ADOBECODEBA...
逆序数的性质。1. 暴力解 1 #include 2 3 #define MAXNUM 5005 4
5 int a[MAXNUM]; 6 7 int main() { 8 int n; 9 int i, j, sum, min;10 11 while
(scanf(...
分类：
其他好文 时间：
2014-05-31 07:50:50
阅读次数：
170
Floyd。注意字典序!!! 1 #include 2 #include 3 4
#define MAXNUM 55 5 #define INF 0x1fffffff 6 7 int cost[MAXNUM][MAXNUM]; 8 int
path[MAXNUM][MAXNUM]; 9 in...
分类：
其他好文 时间：
2014-05-31 04:41:38
阅读次数：
218
Given a strings, partitionssuch that every
substring of the partition is a palindrome.Return the minimum cuts needed for a
palindrome partitioning ofs...
分类：
其他好文 时间：
2014-05-30 15:13:10
阅读次数：
262
Given a triangle, find the minimum path sum
from top to bottom. Each step you may move to adjacent numbers on the row
below.For example, given the fol...
分类：
其他好文 时间：
2014-05-30 14:59:37
阅读次数：
241
