这里用的是尾插法,数组默认为NULL;
const int MaxSize = 101;
Node<int> *ARR[MaxSize];
//使用拉链法解决散列冲突
void Insert(int data) {
if (ARR[data]==NULL) {
Node<int> * s = new Node<int>;
s->data = data;
ARR[data] = s;
s->next = NULL;
}
else {
while (ARR[data]) {
ARR[data] = ARR[data]->next;
}
Node<int> * s = new Node<int>;
s->data = data;
ARR[data] = s;
s->next = NULL;
}
}
//附上一段简单的测试代码
int main() {
int a[10] = { 1,5,6,7,8,9,10,12,14,5};
std::cout << ARR[5]->next->data;