PATA1092题解

hash映射

//
//  main.cpp
//  PATA1092
//
//  Created by Phoenix on 2018/2/21.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cstring>

int table1[256] = {0};
int table2[256] = {0};

int main(int argc, const char * argv[]) {
    char a[1010], b[1010];
    scanf("%s %s", a, b);
    int l1 = strlen(a);
    int l2 = strlen(b);
    for(int i = 0; i < l2; i++) {
        table2[b[i]]++;
    }
    for(int i = 0; i < l1; i++) {
        table1[a[i]]++;
    }
    int need = 0;
    bool flag = true;
    for(int i = 0; i < 256; i++) {
        if(table1[i] < table2[i]) {
            flag = false;
            need += table2[i] - table1[i];
        }
    }
    if(flag == true) {
        printf("Yes %d\n", l1 - l2);
    } else {
        printf("No %d\n", need);
    }
    return 0;
}