BJFUOJ-293

基于链地址法的散列表的删除

#include<iostream>
using namespace std;
const int s = 13;
typedef struct ListNode{
	int data;
	ListNode* next;
	ListNode(){}
	ListNode(int x):data(x),next(nullptr){}
}ListNode,*LinkList;

int H(int key) {
	return key % s;
}
void AddTableNode(LinkList* HashTable, int x) {
	ListNode* p = new ListNode(x);
	ListNode* q = HashTable[H(x)];
	while (q->next) {
		q = q->next;
	}
	q->next = p;
}
void DeleteTableNode(LinkList* HashTable, int x) {
	ListNode* p = HashTable[H(x)]->next;
	ListNode* pre = HashTable[H(x)];
	while (p) {
		if (p->data == x) {
			break;
		}
		pre = p;
		p = p->next;
	}
	if (p != nullptr) {
		pre->next = p->next;
	}
}
void CreateTable(LinkList* HashTable, int n) {
	for (int i = 0; i < s; i++) {
		HashTable[i] = new ListNode(i);
	}
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		AddTableNode(HashTable, x);
	}
}
void printTable(LinkList* HashTable) {
	for (int i = 0; i < s; i++) {
		ListNode* p = HashTable[i]->next;
		cout << i;
		while (p) {
			cout << " " << p->data;
			p = p->next;
		}
		cout << endl;
	}
}

int main() {
	int n;
	while (cin >> n && n != 0) {
		LinkList HashTable[s];
		CreateTable(HashTable, n);
		int x;
		cin >> x;
		DeleteTableNode(HashTable, x);
		printTable(HashTable);
	}


	return 0;
}