Created
May 8, 2014 06:01
-
-
Save kimitoboku/a7b180ac380caad7e6ca to your computer and use it in GitHub Desktop.
レーベンシュタイン距離
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
#include<string.h> | |
int min(int a, int b) { | |
return a<b?a:b; | |
} | |
int levenshtein(char *str1,char *str2){ | |
int str1len = strlen(str1); | |
int str2len = strlen(str2); | |
char buf1[str1len+1]; | |
char buf2[str2len+1]; | |
char buf3[str1len+1]; | |
char buf4[str2len+1]; | |
strcpy(buf1,str1); | |
strcpy(buf2,str2); | |
buf1[str1len-1]='\0'; | |
buf2[str2len-1]='\0'; | |
int i; | |
for(i=1;i<=str1len;i++){ | |
buf3[i-1]=str1[i]; | |
} | |
buf3[str1len] = '\0'; | |
for(i=1;i<=str2len;i++){ | |
buf4[i-1]=str2[i]; | |
} | |
buf4[str2len] = '\0'; | |
if(!strcmp(str1,str2)){ | |
return 0; | |
} | |
if(!strcmp(str1,"")){ | |
return str1len; | |
} | |
if(!strcmp(str2,"")){ | |
return str2len; | |
} | |
return min(min(1+levenshtein(buf1,buf2), | |
min(1+levenshtein(buf1,str2), | |
1+levenshtein(str1,buf2))), | |
min(1+levenshtein(buf3,buf4), | |
min(1+levenshtein(buf3,str2), | |
1+levenshtein(str1,buf4)))); | |
} | |
int main(void){ | |
char str1[256] = {'\0'}; | |
char str2[256] = {'\0'}; | |
scanf("%s",str1); | |
scanf("%s",str2); | |
int n = levenshtein(str1,str2); | |
printf("%d\n",n); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment