for循环判断两个向量对应数是否相等

#include <iostream>
#include <vector>

using namespace std;

int main ()
{
    vector<int> ivec1, ivec2;
	int ival;

	cout << "Enter elements for the first vector: (Ctrl+Z to end)" << endl;
	/*cin >> ival;
	while(ival != 32767)
	{
		ivec1.push_back(ival);
		++ival;
	}*/
	
	while(cin >> ival)
	{
		ivec1.push_back(ival);
	}

	cin.clear(); // clear就是恢复cin的有效状态,然后就可以继续输入,
	cout << "Enter elements for the second vector: (Ctrl+Z to end)" << endl;
	/*cin >> ival;
	while(ival != 32767)
	{
		ivec2.push_back(ival);
        ++ival;
	}*/
	while(cin >> ival)
	{
		ivec2.push_back(ival);
	}
     
	vector<int>::size_type size1,size2;
	size1 = ivec1.size(); //第一个向量的大小,
	size2 = ivec2.size();
	bool result = true;

	for(vector<int>::size_type ix = 0; ix != (size1 > size2 ? size2 : size1); ++ix)
	{
         if(ivec1[ix] != ivec2[ix])
		 {
			 result = false;
			 break;
		 }

	}

	if(result)
         if(size1 < size2)
			 cout << "The first vector is prefix of the second one." << endl;
		 else if(size1 == size2)
			 cout << "Two vectors are equal." << endl;
		 else 
			 cout << "The second vector is prefix of the first one." << endl;

	else
	    cout << "No vector is prefix of the other one.";

	return 0;
}

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值