这道题第一遍提交的时候,竟然忘了更新最长时间。当事人就是很后悔......
class Solution {
public:
char slowestKey(vector<int>& releaseTimes, string keysPressed) {
int timemin = releaseTimes[0];
char res = keysPressed[0];
for (int i = 1; i < releaseTimes.size(); i++) {
if ((releaseTimes[i] - releaseTimes[i - 1]) > timemin) {
res = keysPressed[i];
timemin = releaseTimes[i] - releaseTimes[i - 1]; // 更新timemin
}
else if ((releaseTimes[i] - releaseTimes[i - 1]) == timemin) {
if (keysPressed[i] > res) { // 字典排序最大的那个
res = keysPressed[i];
}
}
}
return res;
}
};