2018年2月18日
131. Palindrome Partitioning(回文子串划分 回溯)
摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文
posted @ 2018-02-18 16:20 乐乐章 阅读(214) 评论(0) 推荐(0)
125. Valid Palindrome(双指针)
摘要： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Pan 阅读全文
posted @ 2018-02-18 15:53 乐乐章 阅读(192) 评论(0) 推荐(0)
9. Palindrome Number(判断整型数字是否是回文，直接暴力即可)
摘要： Determine whether an integer is a palindrome. Do this without extra space. 阅读全文
posted @ 2018-02-18 15:26 乐乐章 阅读(166) 评论(0) 推荐(0)
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. Example: Input: "babad" Output: "b 阅读全文
posted @ 2018-02-18 15:17 乐乐章 阅读(418) 评论(0) 推荐(0)