LintCode 128: Hash Function (hash函数经典题)

128. Hash Function
     中文English
     In data structure Hash, hash function is used to convert a string(or any other type) into an integer smaller than hash size and bigger or equal to zero. The objective of designing a hash function is to “hash” the key as unreasonable as possible. A good hash function can avoid collision as less as possible. A widely used hash function algorithm is using a magic number 33, consider any string as a 33 based big integer like follow:

hashcode(“abcd”) = (ascii(a) * 333 + ascii(b) * 332 + ascii© *33 + ascii(d)) % HASH_SIZE

                          = (97* 333 + 98 * 332 + 99 * 33 +100) % HASH_SIZE

                          = 3595978 % HASH_SIZE

here HASH_SIZE is the capacity of the hash table (you can assume a hash table is like an array with index 0 ~ HASH_SIZE-1).

Given a string as a key and the size of hash table, return the hash value of this key.

Example
Example 1:

Input: key=“abcd”, size = 1000
Output: 978
Explanation: (9733^3 + 9833^2 + 9933 + 1001)%1000 = 978
Example 2:

Input: key=“abcd”, size = 100
Output: 78
Explanation: (9733^3 + 9833^2 + 9933 + 1001)%100 = 78
Clarification
For this problem, you are not necessary to design your own hash algorithm or consider any collision issue, you just need to implement the algorithm as described.

代码如下：

class Solution {
public:
    /**
     * @param key: A string you should hash
     * @param HASH_SIZE: An integer
     * @return: An integer
     */
    int hashCode(string &key, int HASH_SIZE) {
        const int HASH_CONST = 33;
        
        int N = key.size();
        if (N == 0) return 0;
        
        int result = 0;
        
        for (int i = 0; i < N; ++i) {
            result = ((long long)result * HASH_CONST + key[i]) % HASH_SIZE;
        }
        
        return result;
    }
};

注意：
1）result前要用long long，不然N稍微大点结果就溢出。
一个例子是：
“Wrong answer or accepted?”
1000000007