0
点赞
收藏
分享

微信扫一扫

leetcode1629(2022.1.9)

上古神龙 2022-01-09 阅读 12
char slowestKey(vector<int>& releaseTimes, string keysPressed) {
        char ans;
        int maxTime = releaseTimes[0];
        ans = keysPressed[0];
        for (int i = 1; i < keysPressed.size(); i++)
        {
            int tmp = releaseTimes[i] - releaseTimes[i - 1];
            if (tmp > maxTime)
            {
                maxTime = tmp;
                ans = keysPressed[i];
            }
            else if (tmp == maxTime)
            {
                ans = char(max(int(ans), int(keysPressed[i])));
            }

        }
        return ans;
    }

简单求一下差记录一下即可~

举报

相关推荐

0 条评论