zoukankan      html  css  js  c++  java
  • PAT 1084 Broken Keyboard

    #include <cstdio>
    #include <cstdlib>
    #include <vector>
    
    using namespace std;
    
    char linea[82];
    char lineb[82];
    bool tbl[256];
    
    char cap(char ch) {
         if (ch >= 'a' && ch <= 'z') {
            ch -= 'a' - 'A';
         }
         return ch;
    }
    
    int main() {
        scanf("%s", linea);
        scanf("%s", lineb);
        vector<char> broken;
        char cha, chb;
        int ia = 0, ib = 0;
        while (linea[ia]!= '' && lineb[ib] != '') {
              cha = cap(linea[ia]);
              chb = cap(lineb[ib]);
              if (cha == chb) {
                  ia++, ib++;              
              } else {
                  if (!tbl[cha]) {
                     broken.push_back(cha);
                     tbl[cha] = true;
                  }
                  ia++;
              }
        }
        while (linea[ia] != '') {
            cha = cap(linea[ia]);
            if (!tbl[cha]) {
               broken.push_back(cha);
               tbl[cha] = true;
            }
            ia++;
        }
        int len = broken.size();
        for (int i=0; i<len; i++){
            printf("%c", broken[i]);    
        }
        system("pause");    
        return 0;    
    }

    链表Merge类题目

  • 相关阅读:
    DDPG
    Actor Critic
    Policy Gradients
    DQN
    Sarsa
    粘滞键
    Codeforces Round #236 (Div. 2) E. Strictly Positive Matrix 强连通
    hdu 1853 Cyclic Tour KM
    hdu 3435 A new Graph Game KM
    hdu 3488 Tour KM
  • 原文地址:https://www.cnblogs.com/lailailai/p/4078377.html
Copyright © 2011-2022 走看看