jQuery火箭图标返回顶部代码

这个知识点不难,话不多说，直接上代码.

代码如下:

#include "stdafx.h"
#include<iostream>
#define SUCCESS 1
#define UNSUCCESS 0
#define HASHSIZE 12                    //定义散列表长为数组的长度
#define NULLKEY -32768

using namespace std;

typedef struct {
    int *elem;
    int count;
}HashTable;
int m = 0;

int InitHashTable(HashTable &H)        //初始化数列表
{
    int i;
    m = HASHSIZE;
    H.count = m;
    H.elem = new int[m];
    for (i = 0; i < m; i++)
        H.elem[i] = NULLKEY;
    return 1;
}

int Hash(int key)                      //散列函数
{
    return key % m;                    //除留余数法
}

void InsertHash(HashTable &H, int key) //求散列地址
{
    int addr = Hash(key);
    while (H.elem[addr] != NULLKEY)    //如果不为空，则冲突
        addr = (addr + 1) % m;         //开放定址法的线性探测
    H.elem[addr] = key;                //知道有空位后插入关键字
}

int SearchHash(HashTable H, int key, int &addr)//散列表查找关键字
{
    addr = Hash(key);                  //求散列地址
    while (H.elem[addr] != key)        //如果不为空，则冲突
    {
        addr = (addr + 1) % m;         //开放定址法的
        if (H.elem[addr + 1] == NULLKEY || addr == Hash(key))//如果循环回到原点
        {
            return UNSUCCESS;          //关键字不存在
        }
    }
    return SUCCESS;
}


int main()
{
    int arr[HASHSIZE] = { 12,67,56,16,25,37,22,29,15,47,48,34 };
    int i, p, key, result;
    HashTable H;
    key = 39;
    InitHashTable(H);
    for (i = 0; i<m; i++)
        InsertHash(H, arr[i]);
    result = SearchHash(H, key, p);
    if (result)
        cout << "查找 " << key << " 的地址为: " << p << endl;
    else
        cout << "查找 " << key << " 失败。" << endl;

    for (i = 0; i<m; i++)
    {
        key = arr[i];
        SearchHash(H, key, p);
        cout << "查找 " << key << " 的地址为：" << p << endl;
    }
    return 0;
}

运行结果: