Leetcode131. 分割回文串

题目传送： https://leetcode.cn/problems/palindrome-partitioning/

运行效率

代码如下：

//递归解法
public List<List<String>> partition(String s) {
    List<List<String>> result = new ArrayList<>();
    //处理边界情况
    if("".equals(s)){
      List<String> list = new ArrayList<>();
      result.add(list);
      return result;
    }
    if(s.length()==1){
      List<String> list = new ArrayList<>();
      list.add(s);
      result.add(list);
      return result;
    }
    for (int i = 1; i <= s.length(); i++) {
      String fisrtPalindrome = s.substring(0,i);
      //首先要确保第一个字符串是回文，然后递归下去
      boolean palindrome = isPalindrome(fisrtPalindrome);
      if(palindrome){
        String substring1 = s.substring(i);
        List<List<String>> partition = partition(substring1);
        for(List<String> list:partition){
          List<String> arrayList = new ArrayList<>();
          arrayList.add(fisrtPalindrome);
          arrayList.addAll(list);
          result.add(arrayList);
        }
      }
    }
    return  result;
  }
//判断字符串是否是回文
  public boolean isPalindrome(String s) {
    //处理边界情况
    if("".equals(s)){
      return true;
    }
    int left = 0;
    int right = s.length() - 1;
    while (left <= right) {
      char c = s.charAt(left);
      char c1 = s.charAt(right);
      if (c != c1) {
        return false;
      }
      left++;
      right--;
    }
    return true;
  }