Boyer-moore算法(特定输入) [英] boyer-moore algorithm (specific input)
本文介绍了Boyer-moore算法(特定输入)的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
如何使用Visual C ++ 6.0获得BM的结果?
例如:string:aaaaaaaaaaaaaaaaaaaaaaaaaa
模式:aaaa
how can i get the results of BM using visual c++ 6.0?
for ex: string:aaaaaaaaaaaaaaaaaaaaaa
pattern:aaaa
whats the procedure?
推荐答案
更重要的是,问题是什么,恐怕我不知道您的问题是什么.也许您可以为那些不知道谁或什么是博伊摩尔的人,或更重要的是"aaaa"与"aaaaaaaaaaaaaaaaaaaaaaaaaa"之间的关系,用更简单的术语来解释这一点. :confused:
More importantly, what''s the question, I''m afraid that I have no idea what your problem is. Perhaps you could explain this in more simple terms for those of us who have no idea who or what is boyer-moore, or more importantly what is the relation between "aaaa" and "aaaaaaaaaaaaaaaaaaaa". :confused:
Wikipedia条目 [ ^ ]页面上有一些代码,可以帮助您开始.我们仅在此处回答特定"查询.
The Wikipedia entry[^] page has some code, which should get you started. We only answer "specific" queries here.
这篇关于Boyer-moore算法(特定输入)的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文