hashcode.cpp

散列的应用 能够清楚的展示简单的散列 理解散列的意义

#include<iostream>
#include<string>
using namespace std;
void Hash(string[],int);


int main()
{
    string keyWords[32]={"auto", "break", "case", "char", "const","continue", "default","do" ,"double", "else", "enum", "extern",
                         "float", "for", "goto", "if",
                         "int" ,"long" ,"register", "return",
                         "short" ,"signed" ,"sizeof" ,"static",
                         "struct", "switch" ,"typedef" ,"union",
                         "unsigned" ,"void" ,"volatile","while"};
    Hash(keyWords,32);
    
    system("pause");
    return 0;
}


void Hash(string words[] ,int length)
{
     int number(char);
     int numb1=0,numb2=0,numb3=0,hashcode=0;
     for(int i=0;i<length;i++)
     {
        
        numb1=number((words[i].at(0)));
        numb2=number((words[i].at(words[i].length()-1)));
        numb3=words[i].length();
        hashcode=(numb1+numb2+numb3)%256;
        
        cout<<words[i]<<"的散列码是:"<<hashcode<<endl;
           
           
     }
}
int number(char a)
{
    switch(a)
{
    case 'a':
         return 24;
    case 'b':
         return 30;
    case 'c':
         return 14;
    case 'd':
         return 10;
    case 'e':
         return 30;
    case 'f':
         return 3;
    case 'g':
         return 25;
    case 'h':
         return 20;
    case 'i':
         return 11;
    case 'k':
         return 0;
    case 'l':
         return 18;
    case 'm':
         return 0;
    case 'n':
         return 4;
    case 'o':
         return 0;
    case 'r':
         return 5;
    case 's':
         return 0;
    case 't':
         return 0; 
    case 'u':
         return 12;  
    case 'v':
         return 6;  
    case 'w':
         return 26;
     default:
         return 0;
    }
}