华为OJ数据分类处理

旧城等待， 2022-06-17 11:45 173阅读 0赞

<table style="border-spacing:0px; border-collapse:collapse; width:960px; margin-bottom:35px; table-layout:fixed; color:rgb(92,92,92); font-family:glober,'Helvetica Neue',Helvetica,Arial,'Lantinghei SC','Hiragino Sans GB','Microsoft YaHei','Wenquanyi Micro Hei',sans-serif; font-size:14px; line-height:20px"> 
 <tbody style=""> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 描述</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> <pre style="overflow:hidden; font-family:monospace,monospace; font-size:1em; white-space:pre-wrap; word-wrap:break-word; line-height:24px">信息社会，有海量的数据需要分析处理，比如公安局分析身份证号码、QQ用户、手机号码、银行帐号等信息及活动记录。&nbsp;采集输入大数据和分类规则，通过大数据分类处理程序，将大数据分类输出。
 
 
 <div style="position:absolute; width:1px; white-space:nowrap; height:1px; overflow:hidden; top:-1px; left:-1000px"></div></pre> </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 知识点</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 排序</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 运行时间限制</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 0M</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 内存限制</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 0</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 输入</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 一组输入整数序列I和一组规则整数序列R，I和R序列的第一个整数为序列的个数（个数不包含第一个整数）；整数范围为0~0xFFFFFFFF，序列个数不限 
 <div style="position:absolute; width:1px; white-space:nowrap; height:1px; overflow:hidden; top:-1px; left:-1000px"> 
 </div> </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 输出</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 从R依次中取出R&lt;i&gt;，对I进行处理，找到满足条件的I&lt;j&gt;：&nbsp; I&lt;j&gt;整数对应的数字需要连续包含R&lt;i&gt;对应的数字。比如R&lt;i&gt;为23，I&lt;j&gt;为231，那么I&lt;j&gt;包含了R&lt;i&gt;，条件满足&nbsp;。&nbsp; 按R&lt;i&gt;从小到大的顺序: (1)先输出R&lt;i&gt;；&nbsp; (2)再输出满足条件的I&lt;j&gt;的个数；&nbsp; (3)然后输出满足条件的I&lt;j&gt;在I序列中的位置索引(从0开始)；&nbsp; (4)最后再输出I&lt;j&gt;。&nbsp; 附加条件：&nbsp; (1)R&lt;i&gt;需要从小到大排序。相同的R&lt;i&gt;只需要输出索引小的以及满足条件的I&lt;j&gt;，索引大的需要过滤掉&nbsp; (2)如果没有满足条件的I&lt;j&gt;，对应的R&lt;i&gt;不用输出&nbsp; (3)最后需要在输出序列的第一个整数位置记录后续整数序列的个数(不包含“个数”本身) &nbsp; 序列I：15,123,456,786,453,46,7,5,3,665,453456,745,456,786,453,123（第一个15表明后续有15个整数）&nbsp; 序列R：5,6,3,6,3,0（第一个5表明后续有5个整数）&nbsp; 输出：30,&nbsp;3,6,0,123,3,453,7,3,9,453456,13,453,14,123,6,7,1,456,2,786,4,46,8,665,9,453456,11,456,12,786 说明： 30----后续有30个整数 3----从小到大排序，第一个R&lt;i&gt;为0，但没有满足条件的I&lt;j&gt;，不输出0，而下一个R&lt;i&gt;是3 6---&nbsp;存在6个包含3的I&lt;j&gt;&nbsp; 0---&nbsp;123所在的原序号为0&nbsp; 123---&nbsp;123包含3，满足条件&nbsp; 
 <div style="position:absolute; width:1px; white-space:nowrap; height:1px; overflow:hidden; top:-1px; left:-1000px"> 
 </div> </td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 样例输入</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 15 123 456 786 453 46 7 5 3 665 453456 745 456 786 453 123 5 6 3 6 3 0</td> 
 </tr> 
 <tr style=""> 
 <th style="padding:8px 0px; font-weight:normal; width:86px; margin:1px; border:2px solid rgb(255,255,255); background-color:rgb(207,235,252)"> 样例输出</th> 
 <td style="padding:8px 20px; word-break:break-all; word-wrap:break-word; border:2px solid rgb(255,255,255); background-color:rgb(226,243,253); width:872px"> 30 3 6 0 123 3 453 7 3 9 453456 13 453 14 123 6 7 1 456 2 786 4 46 8 665 9 453456 11 456 12 786</td> 
 </tr> 
 </tbody> 
</table>

#include<iostream> 
 #include<string> 
 #include<cstring> 
 #include<algorithm> 
 #include<vector> 
 #include<fstream> 
 
 using namespace std;
 //a是否包含b
 bool isInclude(int a, int b)
 {
 	char str1[100], str2[100];
 	_itoa_s(a, str1,10);
 	_itoa_s(b, str2, 10);
 
 	int len1 = strlen(str1);
 	int len2 = strlen(str2);
 	if (len1 < len2)
 		return false;
 	for (int i = 0; i <= len1-len2; i++)
 	{
 		int j = i;
 		int k = 0;		
 		while (k<len2 && str1[j] == str2[k])
 		{
 			j++; k++;
 		}
 		if (k == len2)
 			return true;
 	}
 	return false;
 }
 int main()
 {
 	vector<int> I;
 	vector<int> R;
 	int n;
 	cin >> n;
 	for (int i = 0; i < n; i++)
 	{
 		int tmp;
 		cin >> tmp;
 		I.push_back(tmp);
 	}
 	cin >> n;
 	for (int i = 0; i < n; i++)
 	{
 		int tmp;
 		cin >> tmp;
 		R.push_back(tmp);
 	}
 
 	if (I.size() == 0 || R.size() == 0)
 	{
 		cout << 0;
 		return 0;
 	}
 
 	sort(R.begin(), R.end());
 
 	vector<int> output;
 	for (int i = 0; i < R.size(); i++)
 	{
 		if (i>0 && R[i] == R[i - 1])
 			continue;
 
 		int count = 0;
 		vector<int> index;
 		vector<int> value;
 		for (int j = 0; j < I.size(); j++)
 		{
 			if (isInclude(I[j], R[i]))
 			{
 				count++;
 				index.push_back(j);
 				value.push_back(I[j]);
 			}
 		}
 
 		if (count != 0)
 		{
 			output.push_back(R[i]);
 			output.push_back(count);
 			for (int j = 0; j < index.size(); j++)
 			{
 				output.push_back(index[j]);
 				output.push_back(value[j]);
 			}		
 		}
 	}
 	//输出结果
 	if (!output.empty())
 	{
 		int count = output.size();
 		cout << count << " ";
 		for (int i = 0; i <count-1; i++)
 			cout << output[i] << " ";
 		cout << output[count-1] << endl;
 	}
 	return 0;
 }