算法初步02 散列

example1

• https://pintia.cn/problem-sets/994805260223102976/problems/994805280074743808
  

#include<iostream>
#include<string.h>
using namespace std;
int main(){
    int hash[257] = {};//init to zero-number
    char str[10001];
    char PATest[] = "PATest";
    cin>>str;
    for(int i=0;i<strlen(str);++i){
        hash[(int)str[i]]++;
    }
    while(1){
        int flag = 0;
        for(int i=0;i<strlen(PATest);++i){
            if(hash[(int)PATest[i]]>0){
                cout<<PATest[i];
                flag = 1;
                --hash[(int)PATest[i]];
            }
        }
        if(flag == 0){
            break;
        }
    }
    return 0;
}

example2:

• https://pintia.cn/problem-sets/994805342720868352/problems/994805374509498368

#include<iostream>
#include<string.h>
using namespace std;

int main(){
    char seller[1001];
    char Eva[1001];
    cin>>seller>>Eva;
    int hash[123] = {};//init to zero-number
    for(int i=0;i<strlen(seller);++i){
        hash[(int)seller[i]]++;
    }
    int negativeNumber = 0;
    for(int i=0;i<strlen(Eva);++i){
        hash[(int)Eva[i]]--;
        if(hash[(int)Eva[i]]<0){
            ++negativeNumber;
        }
    }
    if(negativeNumber>0){
        cout<<"No "<<negativeNumber;
        return 0;
    }
    cout<<"Yes "<<strlen(seller)-strlen(Eva);
}