leetcode 1732. Find the Highest Altitude 需要把0 单独讨论吗

class Solution: def largestAltitude(self, gain: List[int]) -> int:
    a = [0] * (len(gain)+1)

    for i in range(0, (len(gain))):
        
        
        
        a[i+1] = a[i] + gain [i]

    return max(a)
or 0 单独讨论吗  我觉得没必要 但是runtime会提升

highest, cur = 0, 0
        for i in range(0, (len(gain))):
                cur += gain[i]
                highest = max(highest, cur)

        return highest