這是從類幻燈片在我的大學,它大約模式匹配Algotithm .. 模式匹配算法
我嘗試將它下面的Java代碼;
// Get values for both the text T1,T2 ... Tn and the pattern P1 P2 ... Pm
String[] T = {"Java", "is", "too", "delicious", ", Dr.Java", "is", "confrim!"};
String[] P = { "is", "too"};
// Get values for n and m, the size of the text and the pattern, respectively
int n = T.length;
int m = P.length;
// Set k1 the starting location for the attempted match, to 1
int k = 0;
// While(k<=(n-m+1))do
while (k <= (n - m + 1) - 1) {
// Set the value of i to 1
int i = 0;
// Set the value of Mismatch NO
boolean Mismatch = true; // Not found (true - NO)
// While both (i<=m) and (Mismatch = NO) do
while ((i <= m - 1) && (Mismatch)) { // if Not found (true - NO)
// if Pi != Tk+(i-1) then
if (P[i].equals(T[k])) { // if Found(true)
// Set Mismatch to YES
Mismatch = false; // Found (false - YES)
// Else
} else {
// Increment i by 1 (to move to the next character)
i = i + 1;
}
// End of the loop
}
// If mismatch = NO then
if (!Mismatch) { // if Found (false - YES)
// Print the message 'There is a match at position'
System.out.print("There is a match at position ");
// Print the value of k
System.out.println(k);
}
// Increment k by 1
k = k + 1;
// Enf of the loop
}
// Stop, we are finished
但我有一個問題!爲什麼在僞代碼版本中,檢查P是否不等於T?我認爲它寧願檢查P是否等於T(它與我的版本有什麼不同,對我可怕的英語感到抱歉)
謝謝!但我如何解決它?我嘗試更改&&(!Mismatch)和!(P [i] .equals(T [k])),但它不起作用。 –
@Smile您是否在if語句塊中將不匹配設置爲true? – Omnaest
我嘗試了這兩個,但仍然不明白.. –