LeetCode 1732. 找到最高海拔

示例 1：
输入：gain = [-5,1,5,0,-7]
输出：1
解释：海拔高度依次为 [0,-5,-4,1,1,-6] 。最高海拔为 1 。

示例 2：
输入：gain = [-4,-3,-2,-1,4,3,2]
输出：0
解释：海拔高度依次为 [0,-4,-7,-9,-10,-6,-3,-1] 。最高海拔为 0 。
 
提示：
n == gain.length
1 <= n <= 100
-100 <= gain[i] <= 100

class Solution {
public:
    int largestAltitude(vector<int>& gain) {
        int h = 0, maxh = 0;
        for(auto g : gain)
        {
            h += g;
            maxh = max(maxh, h);
        }
        return maxh;
    }
};