Compare two version numbers version1 and version1.
If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.
You may assume that the version strings are non-empty and co...
分类：
其他好文 时间：
2015-01-10 16:40:07
阅读次数：
135
5.3 Tuples and SequencesWe saw that lists and strings have many common properties, e.g., indexing and slicing operations. They are two examples ofsequ...
分类：
编程语言 时间：
2015-01-10 08:49:40
阅读次数：
275
Isomorphic JavaScript: The Future of Web AppsAt Airbnb, we’ve learned a lot over the past few years while building rich web experiences. We dove into ...
分类：
移动开发 时间：
2015-01-10 06:35:06
阅读次数：
197
https://oj.leetcode.com/problems/excel-sheet-column-number/publicclassSolution{
publicinttitleToNumber(Strings){
if(s==null||s.isEmpty())
return0;//invalidinput
char[]chars=s.toCharArray();
intr=0;
for(charc:chars)
{
r=r*26+(c-‘A‘)+1;
}
returnr;
}
}
分类：
其他好文 时间：
2015-01-09 19:31:16
阅读次数：
170
https://oj.leetcode.com/problems/reverse-words-in-a-string/http://blog.csdn.net/linhuanmars/article/details/20982463publicclassSolution{
publicStringreverseWords(Strings){
//SolutionA:
returnreverseWords_Char(s);
//SolutionB:
//returnreverseWords_Split(s..
分类：
其他好文 时间：
2015-01-09 17:36:11
阅读次数：
134
Write a function to find the longest common prefix string amongst an array of strings.
Solution:
class Solution
{
public:
string longestCommonPrefix(vector &strs)
{
vector s = strs...
分类：
其他好文 时间：
2015-01-09 09:17:16
阅读次数：
122
https://oj.leetcode.com/problems/word-break-ii/http://blog.csdn.net/linhuanmars/article/details/22452163publicclassSolution{
publicList<String>wordBreak(Strings,Set<String>dict)
{
//SolutionA:
//returnwordBreak_NP(s,dict);
//SolutionB:
return..
分类：
其他好文 时间：
2015-01-09 01:52:58
阅读次数：
160
https://oj.leetcode.com/problems/word-break/http://blog.csdn.net/linhuanmars/article/details/22358863publicclassSolution{
publicbooleanwordBreak(Strings,Set<String>dict)
{
s="#"+s;//Addadummychar
intlen=s.length();
boolean[]poss=newboolean[len];
poss..
分类：
其他好文 时间：
2015-01-08 18:15:49
阅读次数：
104
https://oj.leetcode.com/problems/palindrome-partitioning/http://blog.csdn.net/linhuanmars/article/details/22777711publicclassSolution{
publicList<List<String>>partition(Strings){
//NP
List<List<String>>result=newArrayList<>()..
分类：
其他好文 时间：
2015-01-08 15:30:19
阅读次数：
111
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs...
分类：
其他好文 时间：
2015-01-08 13:09:06
阅读次数：
175
