代码

#include "router.h"
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <vector>

std::vector<RoutingTableEntry> table;

int q_num;

void init(int n, int q, const RoutingTableEntry *a) {
	for (int i = 0; i < n; ++i) {
        table.push_back(a[i]);
    }
    q_num = q;
}

int checkEqual(unsigned a, unsigned b, int len) {
    // Big Endian
    unsigned temp = 1;
    while (len > 1) {
        temp = temp << 1 + 1;
        --len;
    }
    int cnt = 0;
    if ( (a & temp) != (b & temp)) return 0;
    for (int i = 0; i < 32; ++i) {
        if ( (a & 1) == (b & 1) ) {
            cnt++;
            a >>= 1;
            b >>= 1;
        } else break;
    }
    return cnt;
    
}

unsigned query(unsigned addr) {
    int len = 0;
    unsigned ret_nh;
    for (int i = 0; i < table.size(); ++i) {
        if (checkEqual(addr, table[i].addr, table[i].len) > len) {
            len = checkEqual(addr, table[i].addr, table[i].len);
            ret_nh = table[i].nexthop;
        }
    }

    return ret_nh;
}

评测结果