且构网

分享程序员开发的那些事...
且构网 - 分享程序员编程开发的那些事

如何在字符串中获取匹配单词?

更新时间:2023-02-18 20:03:05

您需要拆分 [ ^ ]两个字符串到数组:

You need to split[^] both strings to arrays:
Array1                Array2
0    Hyderabad        Cybergateway
1    Chennai          hitech city
2    Pune             Hyderabad
3    Delhi            Telangana
4                     India



然后你需要比较它们[ ^ ]使用2个循环:


Then you need to compare them[^] using 2 loops:

First loop         Second loop            Result
0    Hyderabad     0    Cybergateway      False
0    Hyderabad     1    hitech city       False
0    Hyderabad     2    Hyderabad         True
0    Hyderabad     3    Telangana         False
0    Hyderabad     4    India             False
1    Chennai       0    Cybergateway      False
1    Chennai       1    hitech city       False
1    Chennai       2    Hyderabad         False
1    Chennai       3    Telangana         False
1    Chennai       4    India             False
2 ....
//and so on...





如果您对javascript更熟悉,可以使用 indexOf方法(数组)(JavaScript) [ ^ ] 。



详情请见:

数组对象(JavaScript) [ ^ ]

使用数组(JavaScript) [ ^ ]



If you're more familiar with javascript, you can use indexOf Method (Array) (JavaScript)[^].

For further information, please see:
Array Object (JavaScript)[^]
Using Arrays (JavaScript)[^]


检查此Hashtable实现如何在Javascript中实现字典或哈希表? [ ^ ]



伪算法看起来像这样



函数IdentifyCommonString(string srcString1,string srcString2)

{

var hashTable = new HashTable();

var sourceArray1 = srcString1.split(,);

var sourceArray2 = srcString2.split(,);

var arrayLength = sourceArray1.length;

for(var i = 0;我< arrayLength; i ++){

var item = hashTable.get_item(sourceArray1 [i]);

if(!item)

hashTable.set_item(item ,item);

else {

//我们的常用字符串现已确定

alert(item);

}

}



arrayLength = sourceArray2.length;

for(var k = 0; i < arrayLength; k ++){

var item = hashTable.get_item(sourceArray2 [i]);

if(!item)

hashTable .set_item(item,item);

else {

//我们的常用字符串现已被识别

alert(item);

}

}



}
Check this Hashtable implementation How do I implement a Dictionary or Hashtable in Javascript?[^]

The pseudo algorithm could look like this

function IdentifyCommonString(string srcString1, string srcString2)
{
var hashTable = new HashTable();
var sourceArray1 = srcString1.split(",");
var sourceArray2 = srcString2.split(",");
var arrayLength = sourceArray1.length;
for (var i = 0; i < arrayLength; i++) {
var item = hashTable.get_item(sourceArray1[i]);
if (!item)
hashTable.set_item(item, item);
else {
//our common string has now been identified
alert(item);
}
}

arrayLength = sourceArray2.length;
for (var k = 0; i < arrayLength; k++) {
var item = hashTable.get_item(sourceArray2[i]);
if (!item)
hashTable.set_item(item, item);
else {
//our common string has now been identified
alert(item);
}
}

}