1616. 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.

Example 2:

Input: a = "xbdef", b = "xecab"
Output: false

Example 3:

Input: a = "ulacfd", b = "jizalu"
Output: true
Explaination: Split them at index 3:
aprefix = "ula", asuffix = "cfd"
bprefix = "jiz", bsuffix = "alu"
Then, aprefix + bsuffix = "ula" + "alu" = "ulaalu", which is a palindrome.

Constraints:

• 1 <= a.length, b.length <= 105
• a.length == b.length
• a and b consist of lowercase English letters

题目：给定两个字符串，从相同的位置切开，相互交叉组成新的字符串，问是否能组成回文。

思路：分别选取a头b尾和b头a尾，判断组成的是否是回文。可能a头b尾组成回文，但切开位置不一致，这就需要中间的一串字符串本身就是回文，或是a中间，或是b中间。

代码：

class Solution {
public:
    bool checked(string& a, string& b){
        int ia = 0, jb = b.length()-1;
        bool flaga = true, flagb = true;
        while(ia < jb && a[ia] == b[jb]){
            ia++;
            jb--;
        }
        if(ia >= jb) return true;
        while(ia < jb){
            if(a[ia] != a[jb]) flaga = false;
            if(b[ia] != b[jb]) flagb = false;
            if(!flaga && !flagb) return false;
            ia++;
            jb--;
        }
        return true;
    }
    bool checkPalindromeFormation(string a, string b) {
        return checked(a, b) || checked(b, a);        
    }
};

time: O(N), space: O(1)