呀呀呀
C++ 代码
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
string s;
struct edge{
int a,b;
}q[27]={
{1,1},{1,2},{1,3},{2,1},{2,2},{2,3},{3,1},{3,2},{3,3},{4,1},{4,2},{4,3},
{5,1},{5,2},{5,3},{6,1},{6,2},{6,3},{6,4},{7,1},{7,2},{7,3},{8,1},{8,2},{8,3},{8,4},
};
int main(){
while(cin>>s){
int cnt=0;
for(int i=0;i<s.size();i++){
cnt+=q[s[i]-'a'].b;
if(q[s[i]-'a'].a==q[s[i+1]-'a'].a) cnt+=2;
}
cout<<cnt<<endl;
}
return 0;
}