【LeetCode】214. Shortest Palindrome
Shortest Palindrome Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return ...
原文：[LeetCode] 214. Shortest Palindrome 最短回文串
Given a strings, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation. Example : E ...
2015-05-23 03:09 12 23336 推薦指數：
相關推薦
[LeetCode] Shortest Palindrome
Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can ...
[LeetCode] 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. ...
[LeetCode] Longest Palindrome 最長回文串
Given a string which consists of lowercase or uppercase letters, find the length of the longest p ...
[LeetCode] Palindrome Pairs 回文對
[i] + words[j] is a palindrome. Example 1:Given wor ...
[LeetCode] Largest Palindrome Product 最大回文串乘積
Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest ...
[LeetCode] Valid Palindrome 驗證回文字符串
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan ...
[LeetCode] Palindrome Partitioning II 拆分回文串之二
partitioning of s. Example: 這道題是讓找到把原字符串拆分成回文串的最小切割 ...