Longest Palindrome After Substring Concatenation I
You are given two strings, s and t.
You can create a new string by selecting a substring from s (possibly empty) and a substring from t (possibly empty), then concatenating them in order.
Return the length of the longest palindrome that can be formed this way.
Example 1
Input
s = "a", t = "a"Output
2Concatenating
"a" from s and "a" from t results in "aa", which is a palindrome of length 2.Example 2
Input
s = "abc", t = "def"Output
1Since all characters are different, the longest palindrome is any single character, so the answer is 1.
Constraints
- 1 <= s.length, t.length <= 30
- s and t consist of lowercase English letters.