1147. 段式回文
难度hard 段式回文 其实与 一般回文 类似，只不过是最小的单位是 一段字符 而不是 单个字母。 举个例子，对于一般回文 "abcba" 是回文，而 "volvo" 不是，但如果我们把 "volvo" 分为 "vo"、"l"、"vo" 三段，则可以认为 “(vo)(l)(vo)” 是段式回文 ...
原文：[LeetCode] 1147. Longest Chunked Palindrome Decomposition 段式回文
You are given a stringtext. You should split it to k substrings subtext , subtext , ..., subtextk such that: subtextiis anon emptystring. The concatenation of all the substrings is equal totext i.e., ...
2021-07-04 05:01 0 363 推荐指数：
相关推荐
[LeetCode] Longest Palindrome 最长回文串
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. ...
[LeetCode] Palindrome Pairs 回文对
[i] + words[j] is a palindrome. Example 1:Given wor ...
Leetcode 9. Palindrome Number(判断回文数字）
Determine whether an integer is a palindrome. Do this without extra space.（不要使用额外的空间） Some hints: Could negative integers be palindromes? (ie ...
LeetCode Problem 9:Palindrome Number回文数
描述：Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be palindromes? (ie ...
[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] 9. Palindrome Number 验证回文数字
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Example ...
[Leetcode] Longest palindromic substring 最长回文子串
longest palindromic substring. 做这道题之前要先了解什么是回文子串。回文串通俗的 ...