[LeetCode] 555. Split Concatenated Strings 分割串联字符串
Given a list of strings, 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, you need to find the lexicographically biggest string after cutting the loop, which will make the looped string into a regular one.
Specifically, to find the lexicographically biggest string, you need to experience two phases:
- Concatenate all the strings into a loop, where you can reverse some strings or not and connect them in the same order as given.
- Cut and make one breakpoint in any place of the loop, which will make the looped string into a regular one starting from the character at the cutpoint.
And your job is to find the lexicographically biggest one among all the possible regular strings.
Example:
Input: "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".
Note:
- The input strings will only contain lowercase letters.
- The total length of all the strings will not over 1,000.
给定一组字符串,对于每个字符串可以逆序或者不变,将字符串按照原始顺序拼接组成一个字符串,循环每一个字符串拼接它们,可以选择循环中的一个字符串在某一个位置切开。求能得到的字典序最大的字符串。
最终结果一定是从某个字符串在某个地方切开(包括在string[0]之前切开)。其余字符串是否需要reverse则取决于reverse之后其字典序是否会增大,如果增大了就reverse,否则就保持不变,这样才能保证最后的结果是字典序最大的。对于a字符串而言,是否需要反向,以及从哪里切开,均取决于最终形成的字符串头部的字典序大小。
解法:首先将所有的字符串都处理成字典序最大的(反向或者不反向),然后连接起来。接着遍历每个字符串,试图将它以及它的reverse从每个位置切开,并测试形成的regular字符串,一旦发现其字典序大于当前的最大值,则更新当前最大值。最后返回最大值即可。
首先将res初始化为“a”,即为字典序中最小的字符串。而在测试切开位置的过程中,只有在p1[j]或者p2[j]大于res[0]的时候才更新res,这样就可以减少冗余的字符串拼接操作,从而提高运行效率。
第一步,处理原字符串,如果strs[i].reverse > strs[i], 则strs[i] = strs[i].reverse. 可以确保mid string是最优的
第二步,对于一个string array,比如 "abc", "def", "xyz", 先生成一个mid string,mid string没有最后一个string,比如"abcdef". 然后update mid string:
mid = mid.substr(str.length()) + strs[(i+n-1) % n];
这样mid string就变成 defxyz(由abcdef,去掉abc,加上xyz),xyzabc.
然后扫原string array中的每一个string,生成相应的截取result。比如对于abc,我们有mid string = defxyz, 所以组合是:
正序:abc-defxyz, bc-defxyz-a, c-defxyz-ab, defxyz-abc
反序:cba-defxyz, ba-defxyz-c, a-defxyz-cb, defxyz-cba,
然后所有循环中挑出全局最大的.
参考 For every given string, we replace the string with the lexicographically larger string out of the original string and the reversed one. After this, we pick up every new string(chosen as the string on which the cuts will be applied), and apply a cut at all the positions of the currently picked string and form the full concantenated string keeping the rest of the newly formed strings intact. We also reverse the current string and follow the same process. While doing this, we keep a track of the largest lexicographic string found so far.
大厂题:阿里巴巴
Java:
public class Solution {
public String splitLoopedString(String[] strs) {
// 先各自翻转一下
for (int i = 0; i < strs.length; i++) {
String rev = new StringBuilder(strs[i]).reverse().toString();
if (strs[i].compareTo(rev) < 0)
strs[i] = rev;
} String res = "";
// 尝试every str作为那个被cut的
for (int i = 0; i < strs.length; i++) {
String rev = new StringBuilder(strs[i]).reverse().toString();
// 比较其 翻转 和 没翻转
for (String st: new String[] {strs[i], rev}) {
// try every k 作为分界点
for (int k = 0; k < st.length(); k++) {
// 拼接其他strs到t
StringBuilder t = new StringBuilder(st.substring(k));
for (int j = i + 1; j < strs.length; j++)
t.append(strs[j]);
for (int j = 0; j < i; j++)
t.append(strs[j]);
t.append(st.substring(0, k));
// 看t是否最大
if (t.toString().compareTo(res) > 0)
res = t.toString();
}
}
}
return res;
}
}
Java: DFS
public class Solution {
String res = "";
public String splitLoopedString(String[] strs) {
dfs(strs, "", 0, strs.length);
return res;
}
public void dfs(String[] strs, String s, int i, int n) {
if (i < n) {
dfs(strs, s + strs[i], i + 1, n);
dfs(strs, s + new StringBuffer(strs[i]).reverse().toString(), i + 1, n);
} else {
for (int j = 0; j < s.length(); j++) {
String t = s.substring(j) + s.substring(0, j);
if (t.compareTo(res) > 0)
res = t;
}
}
}
}
Java: BFS
public class Solution { public String splitLoopedString(String[] strs) {
Queue < String > queue = new LinkedList < > ();
String res = "";
int i = 0, j = 0;
queue.add("");
while (i < strs.length) {
String t = queue.remove();
queue.add(t + strs[i]);
queue.add(t + new StringBuffer(strs[i]).reverse().toString());
j++;
if (j == 1 << i) {
i++;
j = 0;
}
}
while (!queue.isEmpty()) {
String t = queue.remove();
for (int k = 0; k < t.length(); k++) {
String t1 = t.substring(k) + t.substring(0, k);
if (t1.compareTo(res) > 0)
res = t1;
}
}
return res;
}
}
Java: Optimized Solution
public class Solution {
public String splitLoopedString(String[] strs) {
for (int i = 0; i < strs.length; i++) {
String rev = new StringBuilder(strs[i]).reverse().toString();
if (strs[i].compareTo(rev) < 0)
strs[i] = rev;
}
String res = "";
for (int i = 0; i < strs.length; i++) {
String rev = new StringBuilder(strs[i]).reverse().toString();
for (String st: new String[] {strs[i], rev}) {
for (int k = 0; k < st.length(); k++) {
StringBuilder t = new StringBuilder(st.substring(k));
for (int j = i + 1; j < strs.length; j++)
t.append(strs[j]);
for (int j = 0; j < i; j++)
t.append(strs[j]);
t.append(st.substring(0, k));
if (t.toString().compareTo(res) > 0)
res = t.toString();
}
}
}
return res;
}
}
Python:
class Solution(object):
def splitLoopedString(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
strs = [max(s, s[::-1]) for s in strs]
ans = ''
for i, st in enumerate(strs):
left, right = ''.join(strs[:i]), ''.join(strs[i+1:])
for s in (st, st[::-1]):
for j in range(len(s)):
ans = max(ans, s[j:] + right + left + s[:j])
return ans
C++:
class Solution {
public:
string splitLoopedString(vector<string>& strs) {
if(strs.empty()) return "";
else if(strs.size() == 1) return max(strs[0], string(strs[0].rbegin(), strs[0].rend()));
string all = "";
int n = strs.size();
for(int i=0; i<n; i++){
string temp = string(strs[i].rbegin(), strs[i].rend());
if(temp > strs[i]) strs[i] = temp;
}
for(int i=0; i<n-1; i++){
all += strs[i];
}
string result = all + strs[n-1];
for(int i=0; i<n; i++){
string str = strs[i], rev = string(strs[i].rbegin(), strs[i].rend());
all = all.substr(str.length()) + strs[(i+n-1) % n];
for(int j=0; j<=str.length(); j++){
string s1 = str.substr(j) + all + str.substr(0, j), s2 = rev.substr(j) + all + rev.substr(0, j);
if(s1 >= s2 && s1 > result) result = s1;
else if(s2 >= s1 && s2 > result) result = s2;
}
}
return result;
}
};
C++:
class Solution {
public:
string splitLoopedString(vector<string>& strs) {
if (strs.empty()) return "";
string s = "", res = "a";
int n = strs.size(), cur = 0;
for (string str : strs) {
string t = string(str.rbegin(), str.rend());
s += str > t ? str : t;
}
for (int i = 0; i < n; ++i) {
string t1 = strs[i], t2 = string(t1.rbegin(), t1.rend());
string mid = s.substr(cur + t1.size()) + s.substr(0, cur);
for (int j = 0; j < strs[i].size(); ++j) {
if (t1[j] >= res[0]) res = max(res, t1.substr(j) + mid + t1.substr(0, j));
if (t2[j] >= res[0]) res = max(res, t2.substr(j) + mid + t2.substr(0, j));
}
cur += strs[i].size();
}
return res;
}
};
All LeetCode Questions List 题目汇总
[LeetCode] 555. Split Concatenated Strings 分割串联字符串的更多相关文章
- [LeetCode] Split Concatenated Strings 分割串联字符串
Given a list of strings, you could concatenate these strings together into a loop, where for each st ...
- 【LeetCode】555. Split Concatenated Strings 解题报告(C++)
作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 遍历 日期 题目地址:https://leetcode ...
- LeetCode Split Concatenated Strings
原题链接在这里:https://leetcode.com/problems/split-concatenated-strings/description/ 题目: Given a list of st ...
- [LeetCode] Encode and Decode Strings 加码解码字符串
Design an algorithm to encode a list of strings to a string. The encoded string is then sent over th ...
- [LeetCode] 249. Group Shifted Strings 分组偏移字符串
Given a string, we can "shift" each of its letter to its successive letter, for example: & ...
- LeetCode OJ:Isomorphic Strings(同构字符串)
Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the chara ...
- C语言实现split以某个字符分割一个字符串
方式一: 使用strtok # include <string.h> # include <stdio.h> void split(char *src,const char * ...
- split 将字符串分割成字符串数组
list_name = list_name.split(","); split() 方法用于把一个字符串分割成字符串数组. 语法 stringObject.split(separa ...
- java:字符串的split方法,使用多个分隔符,分割一个字符串
java语言中,多个分隔符,分割一个字符串: String[] tmpAuthors=tempAuthorStr.split(";|,|:|,"); 可以在线测试:java代码 在 ...
随机推荐
- Supermarket(贪心/并查集)
题目链接 原创的博客 题意: 超市里有N个商品. 第i个商品必须在保质期(第di天)之前卖掉, 若卖掉可让超市获得pi的利润. 每天只能卖一个商品. 现在你要让超市获得最大的利润. n , p[i], ...
- 洛谷P3629 [APIO2010]巡逻(树的直径)
如果考虑不算上新修的道路,那么答案显然为\(2*(n-1)\). 考虑\(k=1\)的情况,会发现如果我们新修建一个道路,那么就会有一段路程少走一遍.这时选择连接树的直径的两个端点显然是最优的. 难就 ...
- 【转载】linux性能监控分析及通过nmon_analyse生成分析报表
转载地址:http://www.cnblogs.com/Lam7/p/6604832.html nmon是一款分析 AIX 和 Linux 性能的免费工具 nmon 工具还可以将相同的数据捕获到一个文 ...
- SD介绍
1. 介绍 MMC,MultiMediaCard,即多媒体卡,是一种非易失性存储器件,有7pin,目前已基本被SD卡代替 eMMC,Embedded Multimedia Card,内嵌式存储器,以B ...
- Python 字符串正则处理实例
#coding:utf-8 ''' Created on 2017��9��6�� @author: li.liu ''' from selenium import webdriver from se ...
- treegrid 折叠全部节点
$(".easyui-treegrid").treegrid({ url: '@Url.Action("GetDataDictionaryList", &quo ...
- 【CLAA系列】CLAA协议学习(CS方向)
工作上用Lora,需要开发相关模块,分享一下学习的内容: Lora: 博主是做IT的,对Lora不了解.简单理解为LPWAN(Low Power Wide Area Network)中一种技术,目前主 ...
- java中异步调用注意
Future接口是Java标准API的一部分,在java.util.concurrent包中.Future接口是Java线程Future模式的实现,可以来进行异步计算. 有了Future就可以进行三段 ...
- HBASE-LSM树(转载)
HBASE-LSM树 1.B+树 关于B树.B+树.B树的了解参考:* http://blog.csdn.net/v_july_v/article/details/6530142 优点: 走进搜索引擎 ...
- [RN] React Native 使用 react-navigation 报错 "Unable to resolve module `react-native-gesture-handler`
在React Native 使用 react-navigation 过程中,报错 "Unable to resolve module `react-native-gesture-handle ...