![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
jianguotang
这个作者很懒,什么都没留下…
展开
-
Given a string, find the length of the longest substring without repeating characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”, with the le原创 2017-12-25 17:20:09 · 1289 阅读 · 0 评论 -
经典算法找最长回文
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: “babad”Output: “bab”这里写代码片Note: “aba” is also a valid answer. Example:原创 2017-12-25 20:00:29 · 245 阅读 · 0 评论 -
Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit string “23”原创 2017-12-26 00:24:33 · 235 阅读 · 0 评论 -
Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit string "23"原创 2017-12-26 11:17:36 · 217 阅读 · 0 评论 -
Valid Parentheses
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all valid but原创 2017-12-26 11:18:53 · 246 阅读 · 0 评论 -
生成括号
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())", "(原创 2017-12-26 16:00:52 · 282 阅读 · 0 评论