Clean Python 3, Greedy O(sort)
Sort first, and use largest to save the current possible consecutive largest value\nif current coin is larger than largest, it should be largest + 1.\nOtherwise
Sort first, and use `largest` to save the current possible consecutive largest value\nif current coin is larger than `largest`, it should be largest + 1.\nOtherwise there will be a gap.\n\nTime: `O(sort)`\nSpace: `O(sort)`\n```\nclass Solution:\n    def getMaximumConsecutive(self, coins: List[int]) -> int:\n        largest = 0\n        for coin in sorted(coins):\n            if coin > largest + 1: break\n            largest += coin\n        return largest + 1\n```
[]