Leetcode 1629. Slowest Key [Python]

友好的题目。

class Solution:
    def slowestKey(self, releaseTimes: List[int], keysPressed: str) -> str:
        container = [(keysPressed[0], releaseTimes[0])]
        for i in range(1, len(releaseTimes)):
            container.append((keysPressed[i], releaseTimes[i] - releaseTimes[i-1]))
        container.sort(key = lambda x: (x[1],x[0]), reverse = True)
        return container[0][0]