每日5题分割回文串

Posted 2022-01-18 Alice_yufeng

class Solution 
/*回文判断*/
  private boolean isPalindrome(String str) 
    StringBuffer sb = new StringBuffer(str);
    if (sb.reverse().toString().equals(str)) 
        return true;
    
    return false;
  
/*遍历符合回文条件的字符串组合*/
  private void partitionDP(String str, List<String> oneArray, List<List<String>> res) 
    if (str.isEmpty()) 
        List<String> oneArrayCopy = new ArrayList<>();
        oneArrayCopy.addAll(oneArray);
        res.add(oneArrayCopy);
    

    for (int i = 0; i <= str.length(); i++) 
        String preStr = str.substring(0, i);
        if (!isPalindrome(preStr) || preStr.isEmpty()) 
            continue;
        
        oneArray.add(preStr);
        partitionDP(str.substring(i), oneArray, res);
        oneArray.remove(oneArray.size() - 1);
    
  
/*处理准备工作*/
  public List<List<String>> partition(String s) 
    List<List<String>> result = new ArrayList<>();
    List<String> oneArray = new ArrayList<>();
    partitionDP(s, oneArray, result);
    return result;