http://acm.hdu.edu.cn/showproblem.php?pid=3534
Problem Description
In the Data structure class of HEU, the teacher asks one problem: How to find the longest path of one tree and the number...
分类：
其他好文 时间：
2015-02-14 18:56:57
阅读次数：
190
Problem Description
GTY has n gay friends. To manage them conveniently, every morning he ordered all his gay friends to stand in a line. Every gay friend has a characteristic value ai , to express how...
分类：
其他好文 时间：
2015-02-14 13:47:38
阅读次数：
246
Longest Substring Without Repeating Characters 解题过程。
分类：
其他好文 时间：
2015-02-14 12:14:20
阅读次数：
117
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.
这道题是求一个二叉树的深度。题目中对深度的定义是：从根节点到叶节点依次经...
分类：
其他好文 时间：
2015-02-13 21:15:47
阅读次数：
156
https://oj.leetcode.com/problems/longest-common-prefix/Write a function to find the longest common prefix string amongst an array of strings.解题思路：这题属于...
分类：
其他好文 时间：
2015-02-13 14:33:08
阅读次数：
172
遍历string：1for(string::iterator it=str.begin(); it!=str.end(); it++2 cout<<*it;或者1for(inti=0; i<str.length(); i++)2 cout<<str.at(i);substr：s=s.subs...
分类：
其他好文 时间：
2015-02-12 15:45:54
阅读次数：
190
擦！leetcode题目：Longest Palindromic Substring...
分类：
其他好文 时间：
2015-02-12 00:50:18
阅读次数：
161
Hi guys,I just want to share what I did today. I ordered an OBDII ELM327 scanner off EOBD2.FR to pair with my iPhone 5 and just got it this morning. O...
分类：
移动开发 时间：
2015-02-11 16:00:54
阅读次数：
158
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...
分类：
其他好文 时间：
2015-02-10 23:02:36
阅读次数：
218
leetcode代码利用堆栈：http://oj.leetcode.com/problems/evaluate-reverse-polish-notation/http://oj.leetcode.com/problems/longest-valid-parentheses/ （也可以用一维数组，贪...
分类：
其他好文 时间：
2015-02-10 20:13:24
阅读次数：
351
