算法初步——哈希表B1029/A1084. 旧键盘

#include <bits/stdc++.h>
#include<math.h>
#include <string>
using namespace std;
const int MAX_LEN = 2005;
void upper(char *s, int length) {
    int i = 0;
    for (i = 0; i < length; i++) {
        if (s[i] >= ‘a‘ && s[i] <= ‘z‘) {
            s[i] -= ‘a‘ - ‘A‘;
        }
    }
}
int ToUpper(int c)  
{  
    return toupper(c);  
}  
int main(){
    char str1[100],str2[100];
    bool HashTable[128] = {false};
    cin>>str1;
    cin>>str2;
    int len1 = strlen(str1);
    int len2 = strlen(str2);
    for(int i =0;i<len1;++i){
        int j;
        char c1,c2;
        for(j=0;j<len2;++j){
            c1 = str1[i];
            c2 = str2[j];
            if(c1 >= ‘a‘ && c1 <= ‘z‘) c1 -= 32; //如果是小写字母，则转化为大写
            if(c2 >= ‘a‘ && c2 <= ‘z‘) c2 -= 32;
            if(c1 == c2) break; 
        }
        if(j == len2 && HashTable[c1] == false){
            printf("%c",c1);
            HashTable[c1] = true;
        }
    }
    system("pause");
    return 0;
}