Count subset of binary pattern ..
Posted
by mr.bio
on Stack Overflow
See other posts from Stack Overflow
or by mr.bio
Published on 2010-03-29T19:41:45Z
Indexed on
2010/03/29
19:43 UTC
Read the original article
Hit count: 296
Hi there .
I have a A=set of strings and a B=seperate string. I want to count the number of occurences in from B in A.
Example :
A:
10001
10011
11000
10010
10101
B:
10001
result would be 3.(10001 is a subset of 10001,10011,10101)
So i need a function that takes a set and string and returns an int.
int myfunc(set<string> , string){
int result;
// My Brain is melting
return result ;
}
© Stack Overflow or respective owner
