Split Two Strings to Make Palindrome

You are given two strings a and b of the same length. Choose an index and split both strings at the same index, splitting a into two strings: aprefix and asuffix where a = aprefix + asuffix, and splitting b into two strings: bprefix and bsuffix where b = bprefix + bsuffix. Check if aprefix + bsuffix or bprefix + asuffix forms a palindrome.

When you split a string s into sprefix and ssuffix, either ssuffix or sprefix is allowed to be empty. For example, if s = "abc", then "" + "abc", "a" + "bc", "ab" + "c" , and "abc" + "" are valid splits.

Return true if it is possible to form a palindrome string, otherwise return false.

Notice that x + y denotes the concatenation of strings x and y.

Example 1:

Input: a = "x", b = "y"
Output: true
Explaination: If either a or b are palindromes the answer is true since you can split in the following way:
aprefix = "", asuffix = "x"
bprefix = "", bsuffix = "y"
Then, aprefix + bsuffix = "" + "y" = "y", which is a palindrome.

思路：双指针，i 在a段，j在b的末尾，然后双向走，如果不等了，判断a的剩下的，和b的剩下的是否是palindorme。

class Solution {
    public boolean checkPalindromeFormation(String a, String b) {
        return isPossible(a, b) || isPossible(b, a);
    }
    
    private boolean isPossible(String a, String b) {
        int i = 0; int j = b.length() - 1;
        while(i < a.length() && j >= 0) {
            if(a.charAt(i) == b.charAt(j)) {
                i++;
                j--;
            } else {
                break;
            }
        }
        return ispalindrome(a.substring(i, j + 1)) || ispalindrome(b.substring(i, j + 1));
    }
    
    private boolean ispalindrome(String s) {
        int i = 0; int j = s.length() - 1;
        while(i <= j) {
            if(s.charAt(i) != s.charAt(j)) {
                return false;
            }
            i++;
            j--;
        }
        return true;
    }
}