2015年7月1日
5. Longest Palindromic Substring (最长回文字符串)
摘要： 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 longes 阅读全文
posted @ 2015-07-01 17:19 linqiaozhou 阅读(270) 评论(0) 推荐(0)
32. Longest Valid Parentheses（动态规划 Hard）
摘要： Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the lo 阅读全文
posted @ 2015-07-01 14:46 linqiaozhou 阅读(448) 评论(0) 推荐(0)