Find the Highest Altitude

There is a biker going on a road trip. The road trip consists of n+1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0.

You are given an integer array gain of length n where gain[i] is the net gain in altitude between points i​​​​​​ and i + 1 for all (0 <= i < n). Return the highest altitude of a point.

Example:

Input: gain = [-5,1,5,0,-7]
Output: 1
Explanation: The altitudes are [0,-5,-4,1,1,-6]. The highest is 1.

Approach:

C++

#include <bits/stdc++.h>
using namespace std;

int largestAltitude(vector<int> &gain)
{

    int altitudeSum = 0;
    int maxAltitude = 0;
    for (int i = 0; i < gain.size(); i++)
    {
        altitudeSum += gain[i];
        maxAltitude = max(maxAltitude, altitudeSum);
    }
    return maxAltitude;
}

int main()
{
    vector<int> gain = {-5, 1, 5, 0, -7};

    cout << largestAltitude(gain);

    return 0;
}