CodeForces

字符串的处理

统计已有字符的个数 和需求字符比较

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

using namespace std;

int head[64];
int text[64];
char input[256];
int main()
{
    freopen("in.txt", "r", stdin);
    gets(input);
    for (int i = 0; i < strlen(input); i++)
    {
        if (input[i] >= 'a' && input[i] <= 'z')
        {
            head[input[i] - 'a']++;
        }
        else if ( input[i] >= 'A' && input[i] <= 'Z' )
        {
            head[input[i] - 'A'+26]++;
        }
    }
    gets(input);
    for (int i = 0; i < strlen(input); i++)
    {
        if (input[i] >= 'a' && input[i] <= 'z')
        {
            text[input[i] - 'a']++;
        }
        else if ( input[i] >= 'A' && input[i] <= 'Z' )
        {
            text[input[i] - 'A'+26]++;
        }
    }
    bool judge = true;
    for (int i = 0; i < 52; i++)
    {
        if (text[i] > head[i] )
        {
            judge = false;
            break;
        }
    }
    if (judge) printf("YES
");
    else printf("NO
");
}