摘要：
原题链接在这里：https://leetcode.com/problems/count-and-say/ 题目： The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 阅读全文
posted @ 2015-09-18 11:32
Dylan_Java_NYC
阅读(372)
评论(0)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/longest-common-prefix/ 题目： Write a function to find the longest common prefix string amongst an array of strings 阅读全文
posted @ 2015-09-18 10:28
Dylan_Java_NYC
阅读(195)
评论(0)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/compare-version-numbers/ 题目： Compare two version numbers version1 and version2.If version1 > version2 return 1, 阅读全文
posted @ 2015-09-18 10:01
Dylan_Java_NYC
阅读(166)
评论(0)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/interleaving-string/ 题目： Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1 阅读全文
posted @ 2015-09-18 05:46
Dylan_Java_NYC
阅读(226)
评论(0)
推荐(0)
摘要：
原题链接在这里：https://leetcode.com/problems/distinct-subsequences/ 题目： Given a string S and a string T, count the number of distinct subsequences of S which 阅读全文
posted @ 2015-09-18 04:31
Dylan_Java_NYC
阅读(209)
评论(0)
推荐(0)
浙公网安备 33010602011771号