You are given an array of strings strs. You could concatenate these strings together into a loop, where for each string, you could choose to reverse it or not. Among all the possible loops
Return the lexicographically largest string after cutting the loop, which will make the looped string into a regular one.
Specifically, to find the lexicographically largest string, you need to experience two phases:
And your job is to find the lexicographically largest one among all the possible regular strings.
Example 1:
Input: strs = ["abc","xyz"] Output: "zyxcba" Explanation: You can get the looped string "-abcxyz-", "-abczyx-", "-cbaxyz-", "-cbazyx-", where '-' represents the looped status. The answer string came from the fourth looped one, where you could cut from the middle character 'a' and get "zyxcba".
Example 2:
Input: strs = ["abc"] Output: "cba"
Constraints:
1 <= strs.length <= 10001 <= strs[i].length <= 10001 <= sum(strs[i].length) <= 1000strs[i] consists of lowercase English letters.We first traverse the string array strs. For each string s, if the reversed string t is greater than s, we replace s with t.
Then we enumerate each position i in the string array strs as a split point, dividing the string array strs into two parts: strs[i + 1:] and strs[:i]. We then concatenate these two parts to get a new string t. Next, we enumerate each position j in the current string strs[i]. The suffix part is a = strs[i][j:], and the prefix part is b = strs[i][:j]. We can concatenate a, t, and b to get a new string cur. If cur is greater than the current answer, we update the answer. This considers the case where strs[i] is reversed. We also need to consider the case where strs[i] is not reversed, i.e., concatenate a, t, and b in reverse order to get a new string cur. If cur is greater than the current answer, we update the answer.
Finally, we return the answer.
The time complexity is O(n^2), and the space complexity is O(n). Here, n is the length of the string array strs.
Java
C++
Go
Greatest Common Divisor of Strings - Leetcode 1071 - Python • NeetCodeIO • 76,336 views views
Watch 9 more video solutions →Practice Split Concatenated Strings with our built-in code editor and test cases.
Practice on FleetCode