2019年12月2日

Leetcode_132. Palindrome Partitioning II_[DP]

摘要： 题目链接 Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partiti 阅读全文

posted @ 2019-12-02 21:42 JASONlee3 阅读(161) 评论(0) 推荐(0)

Leetcode_131. Palindrome Partitioning_[DFS]

摘要： 题目链接 Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Examp 阅读全文

posted @ 2019-12-02 21:29 JASONlee3 阅读(227) 评论(0) 推荐(0)

导航