DP、KMP什么的都太高大上了，自己想了个朴素的遍历方法。
【题目】
Given a string S,
find the longest palindromic substring in S.
You may assume that the maximum length of S is
1000, and there exists one unique longest palin...
分类：
其他好文 时间：
2014-10-26 15:37:32
阅读次数：
249
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 ...
分类：
其他好文 时间：
2014-10-26 14:18:14
阅读次数：
251
题目：Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or eq...
分类：
编程语言 时间：
2014-10-26 00:21:33
阅读次数：
216
Write a program to solve a Sudoku puzzle by filling the empty cells.
Empty cells are indicated by the character '.'.
You may assume that there will be only one unique solution.
A sudoku...
分类：
其他好文 时间：
2014-10-25 17:27:41
阅读次数：
232
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array....
分类：
其他好文 时间：
2014-10-25 17:23:51
阅读次数：
131
Ubuntu may stop working after a Chrome OS update. If that's the case, update all the installed targets using the following command (in Chrome OS, open...
分类：
其他好文 时间：
2014-10-25 17:06:23
阅读次数：
128
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where
the candidate numbers sums to T.
Each number in C may only be used once in the combina...
分类：
其他好文 时间：
2014-10-25 14:34:02
阅读次数：
163
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where
the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited numb...
分类：
其他好文 时间：
2014-10-25 11:56:08
阅读次数：
206
题目：Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character'.'.You may assume that there will be...
分类：
其他好文 时间：
2014-10-25 00:46:35
阅读次数：
227
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4
5 6 7 0 1 2).
Find the minimum element.
You may assume no duplicate exists in...
分类：
其他好文 时间：
2014-10-24 13:06:25
阅读次数：
224
