贝壳找房算法岗位对牛弹琴#include (5488)#include #include (5862)#include#include(5850)#include#include(5868)#include#include (5856)#include #include(5850)#include #include(7639)#includeusing namespace std;int fun1(const std::string&str,const std::string&sub)//函数作用:找子串得个数{ int num=0; for(size_t i=0; (i=str.find(sub,i))!=std::string::npos; num++,i++); return num;}int main()//第一题 多次重复包含子串{ int n; cin>>n; int result[n]; for(int i=0;i { result[i]=0; } // for(int i=0;i//{ // cout // } string son_s1="63231323"; string son_s2="53231323"; string son_s3="43231323"; string s; for(int i=0;i { cin>>s; result[i]=fun1(s,son_s1)+fun1(s,son_s2)+fun1(s,son_s3); } for(int i=0;i { cout }}