poj-2159

来源：互联网发布：太平公主知乎编辑：程序博客网时间：2024/06/07 22:25

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

char yes[] = "YES";
char no[] = "NO";

int main() {
    int letterMap[26] = {0};
    int letterMap1[26] = {0};
    int letterNumMap[100] = {0};
    char crypted[102] = "";
    char original[102] = "";
    scanf("%s", crypted);
    scanf("%s", original);
    if (strlen(crypted) != strlen(original)) {
        printf("NO");
        return 0;
    }
    for (int i = 0; i < strlen(crypted); i++) {
        if (crypted[i] >= 'A' && crypted[i] <= 'Z') {
            letterMap[crypted[i] - 'A']++;
        } else {
            printf("NO");
            return 0;
        }
    }
    for (int i = 0; i < sizeof(letterMap)/sizeof(int); i++) {
        letterNumMap[letterMap[i]]++;
    }

    for (int i = 0; i < strlen(original); i++) {
        if (original[i] >= 'A' && original[i] <= 'Z') {
            letterMap1[original[i] - 'A']++;
        } else {
            printf("NO");
            return 0;
        }
    }
    int i;
    for (i = 0; i < sizeof(letterMap)/sizeof(int); i++) {
        int j;
        for (j = 0; j < sizeof(letterMap1)/sizeof(int); j++) {
            if (letterMap[i] == letterMap1[j]) {
                letterMap1[j] = -1;
                break;
            }
        }
        if (j == sizeof(letterMap1)/sizeof(int)) {
            printf("NO");
            return 0;
        }
    }
    if (i == sizeof(letterMap)/sizeof(int)) {
        printf("YES");
    } else {
        printf("NO");
    }
    // for (int i = 0; i < sizeof(letterMap1)/sizeof(int); i++) {
    //     if (letterNumMap[letterMap1[i]] == 0) {
    //         printf("NO");
    //         return 0;
    //     } else {
    //         letterNumMap[letterMap1[i]]--;
    //     }
    // }

}

comments 部分继续研究。

ugly code.

0 0