zengzy - 博客园

2015年12月10日

摘要： Total Accepted:57578Total Submissions:226493Difficulty:MediumGiven an array of strings, group anagrams together.For example, given:["eat", "tea", "tan... 阅读全文

posted @ 2015-12-10 18:46 zengzy 阅读(260) 评论(0) 推荐(0)

Compare Version Numbers

摘要： Total Accepted:39335Total Submissions:242429Difficulty:EasyCompare two version numbersversion1andversion2.Ifversion1>version2return 1, ifversion1v2){ ... 阅读全文

posted @ 2015-12-10 16:36 zengzy 阅读(184) 评论(0) 推荐(0)

Count and Say

摘要： Total Accepted:63607Total Submissions:237192Difficulty:EasyThe count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211... 阅读全文

posted @ 2015-12-10 13:44 zengzy 阅读(160) 评论(0) 推荐(0)

Integer to English Words

摘要： Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231- 1.For example,123 -> "One Hundred T... 阅读全文

posted @ 2015-12-10 13:17 zengzy 阅读(145) 评论(0) 推荐(0)

Longest Common Prefix

摘要： Total Accepted:76601Total Submissions:288579Difficulty:EasyWrite a function to find the longest common prefix string amongst an array of strings.class... 阅读全文

posted @ 2015-12-10 09:17 zengzy 阅读(197) 评论(0) 推荐(0)

Length of Last Word

摘要： Total Accepted:74498Total Submissions:265241Difficulty:EasyGiven a stringsconsists of upper/lower-case alphabets and empty space characters' ', return... 阅读全文

posted @ 2015-12-10 08:58 zengzy 阅读(128) 评论(0) 推荐(0)

2015年12月9日

Shortest Palindrome

摘要： Shortest PalindromeTotal Accepted:13465Total Submissions:74427Difficulty:HardGiven a string S, you are allowed to convert it to a palindrome by adding... 阅读全文

posted @ 2015-12-09 22:10 zengzy 阅读(168) 评论(0) 推荐(0)

2015年12月7日

Longest Palindromic Substring

摘要： Total Accepted:82026Total Submissions:379898Difficulty:MediumGiven a stringS, find the longest palindromic substring inS. You may assume that the maxi... 阅读全文

posted @ 2015-12-07 22:04 zengzy 阅读(155) 评论(0) 推荐(0)

[string]字符串中几个比较难的算法和容易搞混的题目

摘要：一.两个难点算法1.Manacher算法，线性时间求最长回文子串2.KMP算法，字符串匹配问题，c语言中的strStr二.几个题目1.最长回文子串方法：暴力，动态规划，中心扩展，manacher参考：http://blog.163.com/zhaohai_1988/blog/static/20951... 阅读全文

posted @ 2015-12-07 21:14 zengzy 阅读(313) 评论(0) 推荐(0)

Implement strStr()

摘要： Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Subscribeto see which comp... 阅读全文

posted @ 2015-12-07 19:59 zengzy 阅读(180) 评论(0) 推荐(0)

公告