How to allow a certain maximum number (<=5) of mismatch in substring matching? Is there any way to modify KMP to do this? Here is a problem relating to this theory
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 148 |
9 | pajenegod | 145 |
9 | orz | 145 |
How to allow a certain maximum number (<=5) of mismatch in substring matching? Is there any way to modify KMP to do this? Here is a problem relating to this theory
Название |
---|
Please share the problem link if available.
Thanks for share of the problem, I have just solved it. Following is hint.
hash+binary search can do almost everything KMP can do, but it's more powerful.