我有两个字符串,first的结束子字符串是第二个的起始子字符串,ex
string left : ONESTRING
string right : STRINGTWO
我必须合并它们才能生成字符串
result string : ONESTRINGTWO
公共子串的长度事先不知道。 如果起始字符串和结束字符串不常见,我需要返回字符串的串联。
这就是我目前正在做的事情。
for(int i = 1;i< left.length();i++) {
//substring of length "i" from last of left string
string temp = left.substr(left.length() -1 -i,i);
if(temp.length() < right.length()) {
//check if the right string starts with the above substring
if (strncmp(right.c_str(), temp.c_str(), strlen(temp.c_str())) == 0 ) {
// common substring found, save this result
found = true;
result = left.substr(0,left.length()-i-1) + right;
}
}
}
if(found == true) {
return result;
} else {
return left + right;
}
我会感谢任何指向更简单实现的指针(使用任何语言)。
答案 0 :(得分:1)
通过智能使用指针算法,您可以跳过对substr
(进行分配)和strlen
(长度为O( n )的时间的调用字符串)。
std::string concat(std::string const &left, std::string const &right)
{
size_t n = left.length();
for (size_t i=0; i<n; i++)
if (std::strncmp(left.c_str() + i, right.c_str(), n - i) == 0)
return left + (right.c_str() + n - i);
return left + right;
}
答案 1 :(得分:1)
尝试以下...经过测试,它在 JAVA ...
中工作public class FindString {
public static void main(String[] args) {
String myString01 = "OneString";
String myString02 = "StringTwo";
String commonString = "";
for (int i = 0; i < myString01.length(); i++) {
if (myString02.indexOf(myString01.substring(i)) >= 0) {
commonString = myString01.substring(i);
break;
}
}
System.out.println("common is " + commonString);
String firstPart = myString01.substring(0, myString01.indexOf(commonString));
String secondPart = myString02.substring(myString02.indexOf(commonString) + commonString.length());
String finalString = firstPart + commonString + secondPart;
System.out.println("Final String of " + myString01 + " & " + myString02 + " is " + finalString);
}
}
如果您想将它们设为小写然后进行比较,请使用.toLowerCase()
。
我的输出是
common is String
Final String of OneString & StringTwo is OneStringTwo
我相信这就是你想要的......
以上的一些进展如下。
public class FindString {
public static void main(String[] args) {
String myString01 = "StringOne";
String myString02 = "TwoString";
// String myString01 = "StringOne";
// String myString02 = "StringTwo";
// String myString01 = "OneString";
// String myString02 = "TwoString";
// String myString01 = "OneString";
// String myString02 = "StringTwo";
System.out.println("First String is = " + myString01);
System.out.println("Second String is = " + myString02);
String commonString = "";
for (int i = 0; i < myString01.length(); i++) {
if (myString02.indexOf(myString01.substring(i)) >= 0) {
commonString = myString01.substring(i);
break;
}
}
if (commonString.isEmpty()) {
for (int i = 0; i < myString02.length(); i++) {
if (myString01.indexOf(myString02.substring(i)) >= 0) {
commonString = myString02.substring(i);
break;
}
}
}
String firstPart;
if (myString01.indexOf(commonString) > 0) {
firstPart = myString01.substring(0, myString01.indexOf(commonString));
} else {
firstPart = myString01.substring(myString01.indexOf(commonString) + commonString.length());
}
String secondPart;
if (myString02.indexOf(commonString) > 0) {
secondPart = myString02.substring(0, myString02.indexOf(commonString));
} else {
secondPart = myString02.substring(myString02.indexOf(commonString) + commonString.length());
}
System.out.println("First Part = " + firstPart);
System.out.println("Second Part = " + secondPart);
System.out.println("Common Part = " + commonString);
String finalString = firstPart + commonString + secondPart;
System.out.println("Final String of " + myString01 + " & " + myString02 + " is " + finalString);
}
}
答案 2 :(得分:0)
试试这个,它对我有用
public Void FindString (string left ,string right)
{
int i=0;
string result = string.Empty;
for( i = right.Length ; i>=0;i--)
{
if(left.Contains(right.Substring(0,i)))
{
break;
}
}
if(i<right.Length)
{
result =right.Substring(0,i);
}
return left.Replace(result,"") + result +right.Replace(result,"");
}