カテゴリー
Subscribe Now

* You will receive the latest news and updates on your favorite celebrities!

Trending News
Rampsをはじめるきっかけ 

  目次1 日本からの電話2 日本行きを阻む香港政府のコロナ対策3 34歳のふわっとした夢…

Blog Post

米ハーバード大学 CS50:課題「スペルチェックプログラム」の回答例(Harvard CS50 Week 5: Problem Set 5 − Speller)
Lifestyle, Tech

米ハーバード大学 CS50:課題「スペルチェックプログラム」の回答例(Harvard CS50 Week 5: Problem Set 5 − Speller) 

  

Speller: 課題

高速なスペルチェックのプログラムを書くという課題。

https://cs50.harvard.edu/x/2021/psets/5/speller/

 

Speller: 回答例

// Implements a dictionary's functionality
#include <stdbool.h>
#include "dictionary.h"
#include <stdio.h>
#include <cs50.h>
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>

//represents a node in a hash table
typedef struct node
{
    char word[LENGTH + 1];
    struct node *next;
}
node;

// no. of buckets in hash table
const unsigned int N = 26;

// initialise positive hash value using unsigned int
unsigned int hash_value;

// initialise (positive) hash table word count
unsigned int word_count;

// hash table
node *table[N];

// Hashes word to a number
unsigned int hash(const char *word)
{
    unsigned long hash = 5381;
    int c;
    while ((c = toupper(*word++)))
    {
        hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
    }
    return hash % N;
}


// Loads dictionary into memory, returning true if successful else false
bool load(const char *dictionary)
{
    // Open dict
    FILE *file = fopen(dictionary, "r");

    // If file is not opened, return false
    if (file == NULL)
    {
        return false;
    }

    // storage space for word
    char word[LENGTH + 1];

    // Scan dict for strings that are not the end of the file
    while (fscanf(file, "%s", word) != EOF)
    {
        // Allocate memory for new node
        node *n = malloc(sizeof(node));

        // If malloc returns NULL, return false
        if (n == NULL)
        {
            return false;
        }

        // Pointer to next node and word itself
        strcpy(n->word, word);

        // Hash the word to get hash value
        hash_value = hash(word);

        // Set new pointer
        n->next = table[hash_value];

        // Set head to new pointer
        table[hash_value] = n;

        // Increment word count
        word_count++;
    }

    // Close file
    fclose(file);

    // If dict is loaded, return true
    return true;
}

// Returns true if word is in dictionary else false
bool check(const char *word)
{
    //hash the word to get hash value
    hash_value = hash(word);

    //access the linked list
    node *cursor = table[hash_value];

    //go through the linked list
    while (cursor != NULL)
    {
        //check if the word matches
        if (strcasecmp(word, cursor->word) == 0)
        {
            return true;
        }

        //move cursor to next node
        cursor = cursor->next;
    }

    return false;
}

// Returns number of words in dictionary if loaded, else 0 if not yet loaded
unsigned int size(void)
{
    // Check if there are any words
    if (word_count > 0)
    {
        // Return count
        return word_count;
    }

    // Else
    return 0;
}

// Unloads dictionary from memory, returning true if successful else false
bool unload(void)
{
    // Iterate through buckets
    for (int i = 0; i < N; i++)
    {
        // Set cursor to this each bucket location
        node *cursor = table[i];

        // If cursor is not NULL, free
        while (cursor)
        {
            // Create temp
            node *tmp = cursor;

            // Move cursor to next node
            cursor = cursor->next;

            // Free up temp
            free(tmp);
        }

        // If cursor is NULL
        if (i == N - 1 && cursor == NULL)
        {
            return true;
        }
    }

    return false;
}

 

Related posts

コメントを残す

Required fields are marked *