【数据结构】哈希表的创建、查找（C语言实现）_再编写一个函数,实现哈希表的造表和查找操作。

#define _CRT_SECURE_NO_WARNINGS

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

#define ElemType int

#define HASHSIZE 11

#define NUM 9

#define NULLKEY -54321

typedef struct {

    ElemType elem[HASHSIZE];

    int count;

}HashTable;

void InitHashTble(HashTable* H) {

    H->count = HASHSIZE;

    for (int i = 0; i < HASHSIZE; i++) {

         H->elem[i] = NULLKEY;

    }

}

int HashFunction(ElemType key, int p) {

    return(key % p);

}

void InsertHashTable(HashTable* H, ElemType key)

{

    int address;

    address = HashFunction(key, HASHSIZE);

    while (H->elem[address] != NULLKEY)

    {

         address = HashFunction((address + 1), HASHSIZE);

    }

    H->elem[address] = key;

}

int SearchHashTable(HashTable* H, int key) {

    int address;

    address = HashFunction(key, HASHSIZE);

    if (H->elem[address] == NULLKEY) { return -1; }

    else {

         while (H->elem[address] != key) {

             address = HashFunction(address + 1, HASHSIZE);

             if (H->elem[address] == NULLKEY) { return -1; }

         }

         return address;

    }

}

int main() {

    HashTable* H=(HashTable*)malloc(sizeof(HashTable));

    InitHashTble(H);

    int key;

    printf("请依次输入需要存储的%d个整数\n", NUM);

    for (int i = 0; i < NUM; i++) {

         printf("第%d个整数为：\n", i + 1);

         scanf("%d", &key);

         InsertHashTable(H, key);

    }

    printf("\n请输入你要查找的整数：\n");

    scanf("%d", &key);

    int t = SearchHashTable(H, key);

    if (t == -1) { printf("查找失败！不存在该整数\n"); }

    else { printf("该整数存储在第%d个位置\n", t); }

    return 0;

}