C语言程序设计教程（第三版）课后习题11.12 （C++代码）

解题思路:
萌新尝试了下用数组实现左右链表




注意事项:





参考代码:

#include<cstdio>

#include<iostream>

#include<algorithm>

#include <cstring>

using namespace std;

const int maxn = 1010;

int a[maxn],score[maxn],b[maxn];

int lefts[maxn],rights[maxn]; //链 

void lnk(int l,int r){

lefts[r] = l;

rights[l] = r;

}

int main()

{

    int an,bn;

    cin >> an >> bn;

for(int i = 1; i <= an; i++){

cin >> a[i] >> score[i];

rights[i] = i+1; 

lefts[i] = i-1;

}

rights[0] = 1; lefts[0] = an;

int tmp;

for(int i = 1; i <= bn; i++){

cin >> b[i] >> tmp; 

}

for(int i = 1; i <= bn; i++){

for(int j = rights[0]; rights[j] != 0; j = rights[j]){

if(a[j] == b[i]){

int ll = lefts[j];

int rr = rights[j];

lnk(ll,rr);

an--;

break;

}

}

}

cout << an << endl;

for(int j = rights[0]; rights[j] != 0; j = rights[j]){

cout << a[j] << " " << score[j] << endl;

}

    return 0;

}