lintcode-medium-Palindrome Partition-优快云博客

本文介绍了一种递归算法，用于将给定字符串按回文子串进行划分，并返回所有可能的划分组合。通过递归调用和回溯技术实现，确保每个子串都是回文串。

摘要生成于 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.

Example

Given s = "aab", return:

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

public class Solution {
    /**
     * @param s: A string
     * @return: A list of lists of string
     */
    public List<List<String>> partition(String s) {
        // write your code here
        
        List<List<String>> result = new ArrayList<List<String>>();
        
        if(s == null || s.length() == 0)
            return result;
        
        ArrayList<String> line = new ArrayList<String>();
        
        helper(result, line, 0, s);
        
        return result;
    }
    
    public void helper(List<List<String>> result, ArrayList<String> line, int start, String s){
        if(start == s.length()){
            result.add(new ArrayList<String>(line));
            return;
        }
        
        for(int i = start + 1; i <= s.length(); i++){
            String temp = s.substring(start, i);
            
            if(valid(temp)){
                line.add(temp);
                helper(result, line, i, s);
                line.remove(line.size() - 1);
            }
        }
        
        return;
    }
    
    public boolean valid(String s){
        int left = 0;
        int right = s.length() - 1;
        
        while(left < right){
            if(s.charAt(left) != s.charAt(right))
                return false;
            
            left++;
            right--;
        }
        return true;
    }
    
}