Translate all code to English (#1836)

* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
2026-08-23 16:47:13 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,213 @@
+/**
+ * File: hash_map_chaining.c
+ * Created Time: 2023-10-13
+ * Author: SenMing (1206575349@qq.com), krahets (krahets@163.com)
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+// Assume max val length is 100
+#define MAX_SIZE 100
+
+/* Key-value pair */
+typedef struct {
+    int key;
+    char val[MAX_SIZE];
+} Pair;
+
+/* Linked list node */
+typedef struct Node {
+    Pair *pair;
+    struct Node *next;
+} Node;
+
+/* Hash table with separate chaining */
+typedef struct {
+    int size;         // Number of key-value pairs
+    int capacity;     // Hash table capacity
+    double loadThres; // Load factor threshold for triggering expansion
+    int extendRatio;  // Expansion multiplier
+    Node **buckets;   // Bucket array
+} HashMapChaining;
+
+/* Constructor */
+HashMapChaining *newHashMapChaining() {
+    HashMapChaining *hashMap = (HashMapChaining *)malloc(sizeof(HashMapChaining));
+    hashMap->size = 0;
+    hashMap->capacity = 4;
+    hashMap->loadThres = 2.0 / 3.0;
+    hashMap->extendRatio = 2;
+    hashMap->buckets = (Node **)malloc(hashMap->capacity * sizeof(Node *));
+    for (int i = 0; i < hashMap->capacity; i++) {
+        hashMap->buckets[i] = NULL;
+    }
+    return hashMap;
+}
+
+/* Destructor */
+void delHashMapChaining(HashMapChaining *hashMap) {
+    for (int i = 0; i < hashMap->capacity; i++) {
+        Node *cur = hashMap->buckets[i];
+        while (cur) {
+            Node *tmp = cur;
+            cur = cur->next;
+            free(tmp->pair);
+            free(tmp);
+        }
+    }
+    free(hashMap->buckets);
+    free(hashMap);
+}
+
+/* Hash function */
+int hashFunc(HashMapChaining *hashMap, int key) {
+    return key % hashMap->capacity;
+}
+
+/* Load factor */
+double loadFactor(HashMapChaining *hashMap) {
+    return (double)hashMap->size / (double)hashMap->capacity;
+}
+
+/* Query operation */
+char *get(HashMapChaining *hashMap, int key) {
+    int index = hashFunc(hashMap, key);
+    // Traverse bucket, if key is found, return corresponding val
+    Node *cur = hashMap->buckets[index];
+    while (cur) {
+        if (cur->pair->key == key) {
+            return cur->pair->val;
+        }
+        cur = cur->next;
+    }
+    return ""; // Return empty string if key not found
+}
+
+/* Add operation */
+void put(HashMapChaining *hashMap, int key, const char *val);
+
+/* Expand hash table */
+void extend(HashMapChaining *hashMap) {
+    // Temporarily store the original hash table
+    int oldCapacity = hashMap->capacity;
+    Node **oldBuckets = hashMap->buckets;
+    // Initialize expanded new hash table
+    hashMap->capacity *= hashMap->extendRatio;
+    hashMap->buckets = (Node **)malloc(hashMap->capacity * sizeof(Node *));
+    for (int i = 0; i < hashMap->capacity; i++) {
+        hashMap->buckets[i] = NULL;
+    }
+    hashMap->size = 0;
+    // Move key-value pairs from original hash table to new hash table
+    for (int i = 0; i < oldCapacity; i++) {
+        Node *cur = oldBuckets[i];
+        while (cur) {
+            put(hashMap, cur->pair->key, cur->pair->val);
+            Node *temp = cur;
+            cur = cur->next;
+            // Free memory
+            free(temp->pair);
+            free(temp);
+        }
+    }
+
+    free(oldBuckets);
+}
+
+/* Add operation */
+void put(HashMapChaining *hashMap, int key, const char *val) {
+    // When load factor exceeds threshold, perform expansion
+    if (loadFactor(hashMap) > hashMap->loadThres) {
+        extend(hashMap);
+    }
+    int index = hashFunc(hashMap, key);
+    // Traverse bucket, if specified key is encountered, update corresponding val and return
+    Node *cur = hashMap->buckets[index];
+    while (cur) {
+        if (cur->pair->key == key) {
+            strcpy(cur->pair->val, val); // If specified key is found, update corresponding val and return
+            return;
+        }
+        cur = cur->next;
+    }
+    // If key not found, add key-value pair to list head
+    Pair *newPair = (Pair *)malloc(sizeof(Pair));
+    newPair->key = key;
+    strcpy(newPair->val, val);
+    Node *newNode = (Node *)malloc(sizeof(Node));
+    newNode->pair = newPair;
+    newNode->next = hashMap->buckets[index];
+    hashMap->buckets[index] = newNode;
+    hashMap->size++;
+}
+
+/* Remove operation */
+void removeItem(HashMapChaining *hashMap, int key) {
+    int index = hashFunc(hashMap, key);
+    Node *cur = hashMap->buckets[index];
+    Node *pre = NULL;
+    while (cur) {
+        if (cur->pair->key == key) {
+            // Remove key-value pair from it
+            if (pre) {
+                pre->next = cur->next;
+            } else {
+                hashMap->buckets[index] = cur->next;
+            }
+            // Free memory
+            free(cur->pair);
+            free(cur);
+            hashMap->size--;
+            return;
+        }
+        pre = cur;
+        cur = cur->next;
+    }
+}
+
+/* Print hash table */
+void print(HashMapChaining *hashMap) {
+    for (int i = 0; i < hashMap->capacity; i++) {
+        Node *cur = hashMap->buckets[i];
+        printf("[");
+        while (cur) {
+            printf("%d -> %s, ", cur->pair->key, cur->pair->val);
+            cur = cur->next;
+        }
+        printf("]\n");
+    }
+}
+
+/* Driver Code */
+int main() {
+    /* Initialize hash table */
+    HashMapChaining *hashMap = newHashMapChaining();
+
+    /* Add operation */
+    // Add key-value pair (key, value) to the hash table
+    put(hashMap, 12836, "Xiao Ha");
+    put(hashMap, 15937, "Xiao Luo");
+    put(hashMap, 16750, "Xiao Suan");
+    put(hashMap, 13276, "Xiao Fa");
+    put(hashMap, 10583, "Xiao Ya");
+    printf("\nAfter addition, hash table is\nKey -> Value\n");
+    print(hashMap);
+
+    /* Query operation */
+    // Input key into hash table to get value
+    char *name = get(hashMap, 13276);
+    printf("\nInput student ID 13276, found name %s\n", name);
+
+    /* Remove operation */
+    // Remove key-value pair (key, value) from hash table
+    removeItem(hashMap, 12836);
+    printf("\nAfter deleting student ID 12836, hash table is\nKey -> Value\n");
+    print(hashMap);
+
+    /* Free hash table space */
+    delHashMapChaining(hashMap);
+
+    return 0;
+}