64,637
社区成员
发帖
与我相关
我的任务
分享
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
//#include <deque>
using namespace std;
int main()
{
vector<int > num1;
int i;
for(i=1;i<5;i++)
{
num1.push_back(i);
}
vector<int > num2;
num2.push_back(2);
num2.push_back(3);
num2.push_back(4);
num2.push_back(1);
vector<int >::iterator it=num2.begin();
vector<int >::iterator ix=num1.begin();
if (num1.size()!=num2.size())
{
cout << "环形不相等" <<endl;
return 0;
}
for(ix;ix!=num1.end();)
{
vector<int >::iterator result1=find(ix,num1.end(),*it);
if (result1 != num1.end())
{
vector<int >::iterator result2=search(num2.begin(),num2.end(),result1,num1.end());
if(result2==result1)
{
vector<int >::iterator result3=search(num2.rbegin(),/*num2.rend()+*/result2,num1.begin(),/*num1.end()-*/result2);
if(result3!=num1.begin())
{
cout<< "环形相等" <<endl;
return 0;
}
}
else
ix++;
}
else
ix++;
}
if (ix==num1.end())
{
cout << "环形不相等" <<endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
//#include <deque>
using namespace std;
int main()
{
vector<int > num1;
int i;
for(i=1;i<5;i++)
{
num1.push_back(i);
}
vector<int > num2;
num2.push_back(2);
num2.push_back(3);
num2.push_back(4);
num2.push_back(1);
vector<int >::iterator it=num2.begin();
vector<int >::iterator ix=num1.begin();
if (num1.size()!=num2.size())
{
cout << "环形不相等" <<endl;
return 0;
}
for(ix;ix!=num1.end();)
{
vector<int >::iterator result1=find(ix,num1.end(),*it);
if (result1 != num1.end())
{
vector<int >::iterator result2=search(num2.begin(),num2.end(),result1,num1.end());
if(result2==result1)
{
vector<int >::iterator result3=search(num2.begin(),/*num2.rend()+*/result2,num1.begin(),/*num1.end()-*/result2);
if(result3!=num1.begin())
{
cout<< "环形相等" <<endl;
return 0;
}
}
else
ix++;
}
else
ix++;
}
if (ix==num1.end())
{
cout << "环形不相等" <<endl;
}
return 0;
}