Jaccard距离在C语言中的实现

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

// 计算Jaccard距离
double jaccard_distance(char* set1, char* set2) {
    int intersection = 0;  // 交集元素个数
    int union_size = 0;    // 并集元素个数

    int set1_len = strlen(set1);
    int set2_len = strlen(set2);

    // 遍历set1中的每个元素，判断是否在set2中出现
    for (int i = 0; i < set1_len; i++) {
        for (int j = 0; j < set2_len; j++) {
            if (set1[i] == set2[j]) {
                intersection++;
                break;
            }
        }
    }

    union_size = set1_len + set2_len - intersection;

    return 1 - (double)intersection / union_size;
}

int main() {
    char set1[] = "abcde";
    char set2[] = "cdefg";

    double distance = jaccard_distance(set1, set2);
    printf("Jaccard Distance: %f\n", distance);

    return 0;
}