实现思路:
很简单。
实现代码:
class Solution {
public:
char slowestKey(vector<int>& releaseTimes, string keysPressed) {
char ans=keysPressed[0];
int max=releaseTimes[0];
for(int i=1;i<releaseTimes.size();i++){
if(max<releaseTimes[i]-releaseTimes[i-1]){
max=releaseTimes[i]-releaseTimes[i-1];
ans=keysPressed[i];
}
else if (max==releaseTimes[i]-releaseTimes[i-1]&&ans<keysPressed[i]){
max=releaseTimes[i]-releaseTimes[i-1];
ans=keysPressed[i];
}
}
return ans;
}
};