Slowest Key

给一个数组, 代表一个按键松开的时间, 给一个string,代表对应的按键. 问哪个键按下去的时间最长. 如果有相同的最长时间, 返回相对字母序较大的按键

class Solution {
    public char slowestKey(int[] releaseTimes, String keysPressed) {
        int cur = 0;
        int max = 0;
        char max_char = keysPressed.charAt(0);
        for(int i = 0; i < releaseTimes.length; i++) {
            int tmp = releaseTimes[i] - cur;
            if(tmp > max) {
                max = tmp;
                max_char = keysPressed.charAt(i);
            } else if(tmp == max &&  keysPressed.charAt(i) > max_char) {
                max_char = keysPressed.charAt(i);
            }
            cur = releaseTimes[i];
        }
        return max_char;
    }
}