2021年7月4日
[LeetCode] 1147. Longest Chunked Palindrome Decomposition 段式回文
摘要： You are given a string text. You should split it to k substrings (subtext1, subtext2, ..., subtextk) such that: subtexti is a non-empty string. The co 阅读全文
posted @ 2021-07-04 05:01 Grandyang 阅读(556) 评论(0) 推荐(0) 编辑
Fork me on GitHub