每日一九度之 题目1079：手机键盘

//Asimple
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cctype>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <limits.h>
#define INF 0x7fffffff
using namespace std;
const int maxn = 105;
typedef long long ll;
char str[maxn];
int num[] = {2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9};
int cnt[] = {1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,1,2,3,4};

bool isOne(char a, char b) {
    int t1 = num[a-‘a‘];
    int t2 = num[b-‘a‘];
    if(t1 == t2) {
        return true;
    }
    return false;
}

int main(){
    while(scanf("%s",str) != EOF) {
        int len = strlen(str);
        int wait = cnt[(str[0] - ‘a‘)];

        for(int i = 1; i < len; i++) {
            if(isOne(str[i-1], str[i])) {
                wait = wait + 2;
            }
            wait = wait + cnt[(str[i] - ‘a‘)];
        }
        printf("%d\n",wait);
    }    
    return 0;
}