C ++检查列表是否包含子列表

Question

I need a container in which I can check if a sequence of elements are present or not. Same thing as substring matching, just for generic collections. I know it's not hard to write, but if it's implemented in some lib already, I wouldn't bother (maybe Boost has something like this?)

Answer 1

Any sequence container will do. You just need to use std::search algorithm to do the search of the sublist:

vector<int> sequence = ...;
vecter<int> sublist = ...;

vector<int>::iterator pos = std::search(
    sequence.begin(), sequence.end(), 
    sublist.begin(), sublist.end());

if(pos == sequence.end()) 
    // not fount
else 
    // found at pos

Answer 2

你想要std::search吗？

Answer 3

The mismatch algorithm from STL is pretty much strcmp for generic containers.

http://www.cplusplus.com/reference/algorithm/mismatch/