1.select sum(CASE WHEN A.[STATUS]=0 THEN 1 ELSE
0 end) as a1,sum(CASE A.[STATUS] WHEN 1 THEN 1 ELSE 0 end) as a2,sum(CASE
A.[STATUS] WHEN 2 THEN 1 ELS...
分类：
数据库 时间：
2014-06-04 21:10:46
阅读次数：
513
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
class Solution {public: string
simplifyPath(string path) { int len = path.length(); if (len spath; int p = -1,
q = 0; ...
分类：
其他好文 时间：
2014-06-04 20:15:49
阅读次数：
197
Given a collection of candidate numbers (C) and
a target number (T), find all unique combinations inCwhere the candidate numbers
sums toT.Each number ...
分类：
其他好文 时间：
2014-06-04 20:14:25
阅读次数：
287
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 an absolute path for a file (Unix-style),
simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/",
=>"/c"click to show corner cas...
分类：
其他好文 时间：
2014-06-04 19:32:14
阅读次数：
270
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-06-04 19:30:13
阅读次数：
230
Given two binary strings, return their sum
(also a binary string).For example,a ="11"b
="1"Return"100".classSolution{public:stringaddBinary(stringa,st...
分类：
其他好文 时间：
2014-06-04 19:23:09
阅读次数：
235
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...
tomcat 的 server.html
配置文件加在之上path虚拟目录docBase实际目录http://localhost:8080/itcast/1.html
分类：
Web程序 时间：
2014-06-03 13:19:45
阅读次数：
232
