title:
Largest palindrome product
Problem 4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91
99.
Find the l...
分类：
其他好文 时间：
2014-06-07 01:24:27
阅读次数：
398
ld: library not found for -lxxxxxxxx
clang: error: linker command failed with exit code 1 (use -v to see invocation)...
分类：
其他好文 时间：
2014-06-05 12:42:28
阅读次数：
386
【题目】
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 = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BANC".
Note:
If there is no such window in S that covers ...
分类：
其他好文 时间：
2014-06-05 11:14:26
阅读次数：
255
【题目】
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 = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BANC".
Note:
If there is no such window in S that covers ...
Problem Description:
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transa...
分类：
其他好文 时间：
2014-06-05 09:33:52
阅读次数：
342
很多的开源软件在安装过程中会出现找不到动态库的问题我在ubuntu12.04安装lxc时，没有出现这问题，但在centos6.5的时候出现了这问题fix：#find / -name liblxc.so.1#echo "/usr/local/lib/" >> /etc/ld.so.conf#ldconfig...
分类：
其他好文 时间：
2014-06-05 06:23:02
阅读次数：
243
1.failed to lock XXXXX.spl文件
这是你建索引的时候会出现的问题，是你没有把打开的的searchd服务给关闭，因为你打开searchd服务时，他会建立一个叫xxx.spl的临时文件，建索引的时候就会出现冲突
2.FATAL: Tokenizer initialization failure.
词典路径不对，修改实际安装字典路径，默认使用相对路径，建议使用绝对路径。
...
分类：
其他好文 时间：
2014-06-05 04:32:19
阅读次数：
324
Given an array S of n integers, are there elements
a, b, c, and d in S such that a +
b + c + d = target?
Find all unique quadruplets in the array which gives the sum of target.
Note:
...
分类：
其他好文 时间：
2014-06-05 00:34:06
阅读次数：
240
24 Point game
时间限制：3000 ms | 内存限制：65535 KB
难度：5
描述
There is a game which is called 24 Point game.
In this game , you will be given some numbers. Your task is to find an expressi...
分类：
其他好文 时间：
2014-06-04 21:06:57
阅读次数：
295
Given a string, find the length of the longest
substring without repeating characters. For example, the longest substring
without repeating letters fo...
分类：
其他好文 时间：
2014-05-30 23:46:09
阅读次数：
453
