Jillian_sea的博客

题目描述:给定一个字符串 s，找到 s 中最长的回文子串。你可以假设 s 的最大长度为1000。一开始写了暴力搜索法,结果超时了,就上网找了答案,发现一个博客写的很好,推荐https://segmentfault.com/a/1190000003914228class Solution(object): def longestPalindrome(self, s): """...

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...

Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string "".Example 1:Input: ["flower","flow","flight"]Output:...

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of b...

Two Sum  Go to DiscussGiven an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and...