mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 12:46:31 +08:00
63efe61e56
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element. * fix(codes/cpp): Fix access error when printArray(arr, 0) * Update PrintUtil.hpp * fix(codes/c): Fix some errors of cmake build * feat(codes/c): Add hashing_search.c * styles(codes/c): Modify function description * styles(codes/c): Modify binary_search.c code style * fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released. * feat: Add preorder_traversal_i_compact.c * feat(codes/c): Add head_sort.c * feat(codes/c): Add bucket_sort.c * feat(codes/c): Add binary_search_edge.c * fix(codes/c): Add programs that are not managed by cmake (c code) * feat(codes/c): Add selection_sort.c * style(codes/c): Change swap in selection_sort.c to `selectionSort` * styles(codes/c): Change style. * fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters * fix(codes/c): Fix space_complexity.c build error. * feat(codes/c): Add array_binary_tree.c * feat(code/c): Update push_back and pop_back in vector.h * styles(codes/c): Adjust format. * feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes. --------- Co-authored-by: Yudong Jin <krahets@163.com>
68 lines
1.4 KiB
C
68 lines
1.4 KiB
C
/**
|
|
* File: simple_hash.c
|
|
* Created Time: 2023-09-09
|
|
* Author: Gonglja (glj0@outlook.com)
|
|
*/
|
|
|
|
#include "../utils/common.h"
|
|
|
|
/* 加法哈希 */
|
|
int addHash(char *key) {
|
|
long long hash = 0;
|
|
const int MODULUS = 1000000007;
|
|
for (int i = 0; i < strlen(key); i++) {
|
|
hash = (hash + (unsigned char)key[i]) % MODULUS;
|
|
}
|
|
return (int)hash;
|
|
}
|
|
|
|
/* 乘法哈希 */
|
|
int mulHash(char *key) {
|
|
long long hash = 0;
|
|
const int MODULUS = 1000000007;
|
|
for (int i = 0; i < strlen(key); i++) {
|
|
hash = (31 * hash + (unsigned char)key[i]) % MODULUS;
|
|
}
|
|
return (int)hash;
|
|
}
|
|
|
|
/* 异或哈希 */
|
|
int xorHash(char *key) {
|
|
int hash = 0;
|
|
const int MODULUS = 1000000007;
|
|
|
|
for (int i = 0; i < strlen(key); i++) {
|
|
hash ^= (unsigned char)key[i];
|
|
}
|
|
return hash & MODULUS;
|
|
}
|
|
|
|
/* 旋转哈希 */
|
|
int rotHash(char *key) {
|
|
long long hash = 0;
|
|
const int MODULUS = 1000000007;
|
|
for (int i = 0; i < strlen(key); i++) {
|
|
hash = ((hash << 4) ^ (hash >> 28) ^ (unsigned char)key[i]) % MODULUS;
|
|
}
|
|
|
|
return (int)hash;
|
|
}
|
|
|
|
/* Driver Code */
|
|
int main() {
|
|
char *key = "Hello dsad3241241dsa算123法";
|
|
|
|
int hash = addHash(key);
|
|
printf("加法哈希值为 %d\n", hash);
|
|
|
|
hash = mulHash(key);
|
|
printf("乘法哈希值为 %d\n", hash);
|
|
|
|
hash = xorHash(key);
|
|
printf("异或哈希值为 %d\n", hash);
|
|
|
|
hash = rotHash(key);
|
|
printf("旋转哈希值为 %d\n", hash);
|
|
|
|
return 0;
|
|
}
|