leetcode: Minimum Window Substring

最新推荐文章于 2025-02-20 13:41:31 发布

原创最新推荐文章于 2025-02-20 13:41:31 发布 · 321 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

leetcode

230 篇文章

订阅专栏

本文介绍了一种用于将字符串划分成多个回文子串的有效算法。通过递归方式检查子串是否为回文，并记录所有可能的回文划分方案。例如，对于输入'aab'，算法返回[['aa', 'b'], ['a', 'a', 'b']]。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a string s, partition s such that every substring of the partition is a palindrome.

Return all possible palindrome partitioning of s.

For example, given s = "aab",
Return

  [
    ["aa","b"],
    ["a","a","b"]
  ]

Show Tags

Have you met this question in a real interview?

Yes

Discuss

class Solution {
public:

    bool isPalindrome(string s)
    {
        if (s.size() == 1)
            return true;
    
        int front = 0;
        int rear  = s.size()-1;
    
        while (front < rear)
        {
            if (s.at(front) == s.at(rear))
            {
                front++;
                rear--;
            }
            else
            {
                return false;
            }
        }
        return true;
    }

    void partitionInternal(string s, vector<string> &curVector, vector<vector<string>> &retVector)
    {
        if (s.size() == 0)
        {
            retVector.push_back(curVector);
        }
    
        for (int i=1; i<=s.size(); i++)
        {
            string substring = s.substr(0, i);
            if (isPalindrome(substring))
            {
                curVector.push_back(substring);
                partitionInternal(s.substr(i, s.size()-i), curVector, retVector);
		curVector.pop_back();
            }
            // we can not just return if isPalindrome(substring) is false
            // for example abbab; ba is false, but bab is ture
        }
    }

    vector<vector<string>> partition(string s) {
    
        vector<vector<string>> retVector;
    
        for (int i=1; i<=s.size(); i++)
        {
            string substring = s.substr(0, i);
            vector<string> curVector;
            if (isPalindrome(substring))
            {
                curVector.push_back(substring);
                partitionInternal(s.substr(i, s.size()-i), curVector, retVector);
	<span style="white-space:pre">	</span>curVector.pop_back(); // this pop_back is important
            }
        }
    
        return retVector;
    }
};