Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类:
其他好文 时间:
2015-03-20 09:12:38
阅读次数:
107
For this problem, we are OK to use hash set, since no numbers are needed. 1 class Solution { 2 public: 3 int lengthOfLongestSubstring(string s) { ...
分类:
其他好文 时间:
2015-03-20 09:09:30
阅读次数:
101
At first beginning, I was trying to use hash set to record the characters. But I found that was wrong.Because if there are couple same chars, when you...
分类:
其他好文 时间:
2015-03-20 08:06:07
阅读次数:
164
Seach one by one. 1 class Solution { 2 public: 3 string getNext(const string& s1, const string& s2) { 4 int len = min(s1.size(), s2.size()...
分类:
其他好文 时间:
2015-03-20 08:06:00
阅读次数:
121
O(n2): 1 class Solution { 2 public: 3 string getP(string s, int start, int end) { 4 while (start >= 0 && end result.size()) result = s1;1...
分类:
其他好文 时间:
2015-03-20 08:05:24
阅读次数:
123
It use the hashset to do the tricks. 1 class Solution { 2 public: 3 int longestConsecutive(vector &num) { 4 int len = num.size(), result =...
分类:
其他好文 时间:
2015-03-20 08:02:46
阅读次数:
146
https://leetcode.com/problems/longest-consecutive-sequence/Given an unsorted array of integers, find the length of the longest consecutive elements se...
分类:
其他好文 时间:
2015-03-19 21:38:49
阅读次数:
164
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-03-19 06:23:34
阅读次数:
126
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类:
其他好文 时间:
2015-03-18 22:59:37
阅读次数:
170
problem:
Write a function to find the longest common prefix string amongst an array of strings.
寻找 0 ~n 个字符串的最长公共前缀
thinking:
(1)公共前缀很好理解,按位匹配即可
(2)很容易忘记处理0、1个字符串的情况。
code:
string prefi...
分类:
其他好文 时间:
2015-03-18 18:05:15
阅读次数:
112