贝壳找房算法岗位对牛弹琴#include <iostream>(5488)#include <math.h>#include <cstdio>(5862)#include<algorithm>#include<string>(5850)#include<stdlib.h>#include<map>(5868)#include<stdio.h>#include <string.h>(5856)#include <vector>#include<string>(5850)#include <bits/stdc++.h>#include<iomanip>(7639)#include<math.h>using 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<n;i++){result[i]=0;}// for(int i=0;i<n;i++)//{// cout<<result[i]<<endl;//结果输出// }string son_s1="63231323";string son_s2="53231323";string son_s3="43231323";string s;for(int i=0;i<n;i++){cin>>s;result[i]=fun1(s,son_s1)+fun1(s,son_s2)+fun1(s,son_s3);}for(int i=0;i<n;i++){cout<<result[i]<<endl;//结果输出}}
