poj-2159 2nd

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

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

int main() {
    int letterMap[26] = {0};
    int letterMap1[26] = {0};
    int letterNumMap[101] = {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;
        }
    }

    for (int i = 0; i < sizeof(letterMap1)/sizeof(int); i++) {
        if (letterNumMap[letterMap1[i]] == 0) {
            printf("NO");
            return 0;
        } else {
            letterNumMap[letterMap1[i]]--;
        }
    }
    printf("YES");

}

空间换时间， 一开始太2B了， 应该是 letterNumMap[101](对应出现了0~100次) 而不是 letterNumMap[101]。