#include<time.h>#include<stdlib.h>#include<stdio.h>void main(){ srand((unsigned)time(NULL)); //用當前系統(tǒng)時間設置種子 int a[10]; int b[8]; printf("隨即初始化a數(shù)組的10個數(shù)(范圍是0~10).\n"); for(int i=0;i<10;i++){ a[i]=rand()%11; //用rand函數(shù)生成0-10的隨機數(shù)并賦值給數(shù)組a[i] printf("%4d",a[i]); if(i%10==0 && i!=0) printf("\n");} printf("隨即初始化b數(shù)組的8個數(shù)(范圍是0~8).\n"); for (int j=0;j<8;j++){ b[j] =rand()%8; printf("%4d", b[j]); if(i%8==0 && i!=0) printf("\n"); } getchar();}
5 回答
snowmanJS
TA貢獻89條經(jīng)驗 獲得超53個贊
#include?<iostream>
#include?<time.h>
#include?<stdlib.h>
#include??<vector>
using?namespace?std;
//生成數(shù)組
int?*createArr(int?*arr,?int?size)
{
????srand((unsigned)time(NULL));
????for?(int?i?=?0;i?<?size;++i)
????????arr[i]?=?rand()?%?(size+1);
????return?arr;
}
//打印數(shù)組
void?printArr(int?*arr,?int?size)
{
????for?(int?i?=?0;i?<size;?++i)
????????cout?<<?arr[i]?<<?"?";
????cout?<<?endl;
}
//若數(shù)組中的元素被比較過返回true
bool?isRet(const?vector<int>?ret,?int?val)
{
????bool?flag?=?false;
????auto?beg?=?ret.cbegin();
????auto?ending?=?ret.cend();
????while(beg!=ending)
????{
????????if?(val?==?*beg)
????????{
????????????flag?=?true;
????????????break;
????????}????
????????++beg;
????}
????return?flag;
}
//查找比對
void?findSameElement(int?*arr1,?int?size1,?int?*arr2,?int?size2)
{
????vector<int>?flag;
????int?cntArr1?=?1;
????int?cntArr2?=?0;
????for?(int?i?=?0;i?<?size1;++i)
????{
????????if?(isRet(flag,?arr1[i]))
????????{
????????????continue;
????????}
????????????
????????cout?<<?"arr1["?<<?i??<<?"]";
????????for?(int?j?=?i?+?1;j?<?size1;++j)
????????{
????????????if?(arr1[i]?==?arr1[j])
????????????{
????????????????cout?<<?"=arr1["?<<?j?<<?"]";
????????????????++cntArr1;
????????????}????
????????}
????????for?(int?k?=?0;k?<?size2;++k)
????????{
????????????if?(arr2[k]?==?arr1[i])
????????????{
????????????????cout?<<?"=arr2["?<<?k?<<?"]";
????????????????++cntArr2;
????????????}
????????}
????????cout<<"="<<arr1[i]?<<endl;
????????cout?<<?arr1[i]?<<?"一共出現(xiàn)"?<<?cntArr1?+?cntArr2?<<?"次，其中在arr1中出現(xiàn)"?<<?cntArr1?<<?"次,在arr2中出現(xiàn)"?<<?cntArr2?<<?"次"?<<?endl;
????????cout?<<?"----------------------------------------------------------"?<<?endl;
????????flag.push_back(arr1[i]);
????????for?(auto?val?:?flag)
????????????cout?<<?val?<<?"?";
????????cout?<<?endl;
????????cntArr1?=?1;
????????cntArr2?=?0;
????}
}
int?main()
{
????const?int?N1?=?10;//定義arr1的維度，數(shù)值可以任意改
????const?int?N2?=?8;//定義arr2的維度，數(shù)值可以任意改
????int?arr1[N1];
????int?arr2[N2];
????//生成兩個數(shù)組
????createArr(arr1,?N1);
????createArr(arr2,?N2);
????//打印兩個數(shù)組
????cout?<<?"arr1:"?<<?endl;
????printArr(arr1,?N1);
????cout?<<?"arr2:"?<<?endl;
????printArr(arr2,?N2);
????//輸出結果
????cout?<<?"比對結果："?<<?endl;
????findSameElement(arr1,N1,?arr2,?N2);
????system("pause");
????return?0;
}
- 5 回答
- 1 關注
- 2177 瀏覽
添加回答
舉報
0/150
提交
取消