金海佳学C++primer 练习9.15/9.16

判断两个vector是否相等

Practice9.15

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <list>
#include <iterator>
#include <cmath>
#include <cstring>
#include <forward_list>
using namespace std;

bool my_equal(vector<int> v1, vector<int> v2) {
    int len1 = (int)v1.size();
    int len2 = (int)v2.size();
    if(len1 != len2) return false;
    for(int i = 0; i < len1; i++) {
        if(v1[i] != v2[i]) return false;
    }
    return true;
}
int main() {
    vector<int> v1 = {1, 2, 3, 4};
    vector<int> v2 = {1, 2, 3, 4};
    /* test1 */
    cout << "v1 == v2?" << endl;
    cout << my_equal(v1, v2) << endl;
    vector<int> v3 = {9, 8, 4, 4};
    /* test2 */
    cout << "v1 == v3?" << endl;
    cout << my_equal(v1, v3) << endl;   
    return 0;
}

Output

v1 == v2?
1
v1 == v3?
0

Practice9.16

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <list>
#include <iterator>
#include <cmath>
#include <cstring>
#include <forward_list>
using namespace std;

bool my_equal_2(list<int> l1, vector<int> v2) {
    int len1 = (int)l1.size();
    int len2 = (int)v2.size();
    if(len1 != len2) return false;
    auto it = l1.begin();
    for(int i = 0; i < len2; i++) {
        if(*it != v2[i]) return false;
        it++;
    }
    return true;
}

bool my_equal(vector<int> v1, vector<int> v2) {
    int len1 = (int)v1.size();
    int len2 = (int)v2.size();
    if(len1 != len2) return false;
    for(int i = 0; i < len1; i++) {
        if(v1[i] != v2[i]) return false;
    }
    return true;
}
int main() {
    list<int> l1 = {1, 2, 3, 4};
    vector<int> v1 = {1, 2, 3, 4};
    vector<int> v2 = {8, 3, 45, 5};
    /* test1 */
    cout << "l1 == v1?" << endl;
    cout << my_equal_2(l1, v1) << endl;
    /* test2 */
    cout << "l1 == v2?" << endl;
    cout << my_equal_2(l1,v2) << endl;  
    return 0;
}

Output

l1 == v1?
1
l1 == v2?
0

Bad times make a good man

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值