题目 Given a string s,find the longest palindromic substring in S.You may assume that the maximum length of S is 1000,and there exist one unique longes....
分类：
其他好文 时间：
2014-09-17 21:46:02
阅读次数：
238
题目：
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
AC率第二高的题啦，二项树的最长路径。初看此题...
分类：
其他好文 时间：
2014-09-17 20:26:52
阅读次数：
162
for ($i = 0; $i -lt 100; $i++){$progressbar1.Minimum = 0$progressbar1.Maximum = 99$progressbar1.Value = $i#Start-Sleep 1}
分类：
其他好文 时间：
2014-09-17 11:57:32
阅读次数：
155
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类：
其他好文 时间：
2014-09-16 00:15:49
阅读次数：
196
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-09-15 15:46:19
阅读次数：
183
Given a binary tree, find the maximum path sum.
The path may start and end at any node in the tree.
For example:
Given the below binary tree,
1
/ 2 3
Return 6....
分类：
其他好文 时间：
2014-09-15 12:58:38
阅读次数：
168
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2014-09-14 12:49:37
阅读次数：
214
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类：
其他好文 时间：
2014-09-13 20:08:35
阅读次数：
179
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-09-12 14:45:53
阅读次数：
213
首先my sql有个配置文件 my.ini，该文件在mysql的安装包中。1.在该文件中可以设置mysql的最大连接数，# The maximum amount of concurrent sessions the MySQL server will# allow. One of these con...
分类：
数据库 时间：
2014-09-11 16:43:02
阅读次数：
261
