mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 10:56:29 +08:00
66 lines
1.6 KiB
Java
66 lines
1.6 KiB
Java
|
/**
|
||
|
* File: simple_hash.java
|
||
|
* Created Time: 2023-06-21
|
||
|
* Author: krahets (krahets@163.com)
|
||
|
*/
|
||
|
|
||
|
package chapter_hashing;
|
||
|
|
||
|
public class simple_hash {
|
||
|
/* 加法雜湊 */
|
||
|
static int addHash(String key) {
|
||
|
long hash = 0;
|
||
|
final int MODULUS = 1000000007;
|
||
|
for (char c : key.toCharArray()) {
|
||
|
hash = (hash + (int) c) % MODULUS;
|
||
|
}
|
||
|
return (int) hash;
|
||
|
}
|
||
|
|
||
|
/* 乘法雜湊 */
|
||
|
static int mulHash(String key) {
|
||
|
long hash = 0;
|
||
|
final int MODULUS = 1000000007;
|
||
|
for (char c : key.toCharArray()) {
|
||
|
hash = (31 * hash + (int) c) % MODULUS;
|
||
|
}
|
||
|
return (int) hash;
|
||
|
}
|
||
|
|
||
|
/* 互斥或雜湊 */
|
||
|
static int xorHash(String key) {
|
||
|
int hash = 0;
|
||
|
final int MODULUS = 1000000007;
|
||
|
for (char c : key.toCharArray()) {
|
||
|
hash ^= (int) c;
|
||
|
}
|
||
|
return hash & MODULUS;
|
||
|
}
|
||
|
|
||
|
/* 旋轉雜湊 */
|
||
|
static int rotHash(String key) {
|
||
|
long hash = 0;
|
||
|
final int MODULUS = 1000000007;
|
||
|
for (char c : key.toCharArray()) {
|
||
|
hash = ((hash << 4) ^ (hash >> 28) ^ (int) c) % MODULUS;
|
||
|
}
|
||
|
return (int) hash;
|
||
|
}
|
||
|
|
||
|
public static void main(String[] args) {
|
||
|
String key = "Hello 演算法";
|
||
|
|
||
|
int hash = addHash(key);
|
||
|
System.out.println("加法雜湊值為 " + hash);
|
||
|
|
||
|
hash = mulHash(key);
|
||
|
System.out.println("乘法雜湊值為 " + hash);
|
||
|
|
||
|
hash = xorHash(key);
|
||
|
System.out.println("互斥或雜湊值為 " + hash);
|
||
|
|
||
|
hash = rotHash(key);
|
||
|
System.out.println("旋轉雜湊值為 " + hash);
|
||
|
}
|
||
|
}
|