[leecode周赛] 1629. Slowest Key

class Solution {
public:
    char slowestKey(vector<int>& releaseTimes, string keysPressed) {
        int temp=0,flag=0;
        temp=releaseTimes[0];
        for(int i=1;i<keysPressed.length();i++){
        	if(releaseTimes[i]-releaseTimes[i-1]>temp){
                temp=releaseTimes[i]-releaseTimes[i-1];
                flag=i;
            }
            else if(releaseTimes[i]-releaseTimes[i-1]==temp){
            	if(keysPressed[i]>keysPressed[flag])
            		flag=i;
			}
            
		}
        return keysPressed[flag];
    }
};

so easy traverse kind solving problem.