[LeetCode] Longest Palindrome 最长回文串
Given a string which consists of lowercase or uppercase letters, find the length of the longest p ...
原文：[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 palindrome mod . Example: Input: Output: Explanation: x , ...
2017-10-10 11:32 0 3768 推荐指数：
相关推荐
[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] Palindrome Pairs 回文对
[i] + words[j] is a palindrome. Example 1:Given wor ...
[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: 这道题是让找到把原字符串拆分成回文串的最小切割 ...
[LeetCode] Find the Closest Palindrome 寻找最近的回文串
Given an integer n, find the closest integer (not including itself), which is a palindrome. The 'closest' is defined as absolute difference ...
[LeetCode] 214. 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 ...
LeetCode：152_Maximum Product Subarray | 最大乘积连续子数组 | Medium
题目：Maximum Product Subarray 这道题属于动态规划的题型，之前常见的是Maximum SubArray，现在是Product Subarray，不过思想是一致的。当然不用动态规划，常规方法也是可以做的，但是时间复杂度过高（TimeOut），像下面这种形式 ...