甲级pat-1032

#include
#include
using namespace std;
const int maxn=100001;
int hashTable[maxn]={0};
struct Node{
    int address;
    char data;
    int next;
}node[maxn];
int main(){
    bool flag=false;
    int st1,st2,n,address,next;
    int arr1[maxn],arr2[maxn];
    char s;
    scanf("%d %d %d",&st1,&st2,&n);
    for(int i=0;i

你可能感兴趣的:(数据结构)