1686. Stone Game VI - cocoder39/coco39_LC GitHub Wiki

1686. Stone Game VI

class Solution:
    def stoneGameVI(self, aliceValues: List[int], bobValues: List[int]) -> int:
        n = len(aliceValues)
        values = [(aliceValues[i]+bobValues[i], i) for i in range(n)]
        values = sorted(values, key=lambda v: v[0], reverse = True)
                        
        alice, bob = 0, 0
        for i in range(n):
            j = values[i][1]
            if i % 2 == 0:
                alice += aliceValues[j]
            else:
                bob += bobValues[j]
        
        if alice > bob:
            return 1
        elif alice < bob:
            return -1
        else:
            return 0