class Solution {
public:
int minTimeToType(string word) {
int ans = 0;
char pre = 'a';
for (auto& ch : word) {
ans += min(abs(ch - pre), 26 - abs(ch - pre));
ans++;
pre = ch;
}
return ans;
}
};
代码上:在一个环上,字符a到字符b的最短距离:min(abs(a - b), 26 - abs(a - b))