2018年9月11日
[LeetCode] 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. Example: 解 阅读全文
posted @ 2018-09-11 15:15 轻风舞动 阅读(940) 评论(0) 推荐(0)
[LeetCode] 527. Word Abbreviation 单词缩写
摘要： Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below. Example: Not 阅读全文
posted @ 2018-09-11 03:32 轻风舞动 阅读(1261) 评论(0) 推荐(0)
[LeetCode] 38. Count and Say 计数和读法
摘要： The count-and-say sequence is the sequence of integers with the first five terms as following: 1 is read off as "one 1" or 11.11 is read off as "two 1 阅读全文
posted @ 2018-09-11 02:57 轻风舞动 阅读(719) 评论(0) 推荐(0)