LeetCode //C - 1732. Find the Highest Altitude

1732. 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 1:

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

Example 2:

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

Constraints:

• n == gain.length
• 1 <= n <= 100
• -100 <= gain[i] <= 100

From: LeetCode
Link: 1732. Find the Highest Altitude

---

Solution:

Ideas：

1. Initialize two integer variables: currentAltitude and highestAltitude. Set both of them to 0 initially.
2. Iterate through the gain array. For each element in the array, add its value to currentAltitude.
3. After updating currentAltitude, check if it’s higher than highestAltitude. If it is, update highestAltitude with the value of currentAltitude.
4. After the loop, highestAltitude will hold the maximum altitude reached, so return it.

Code:

int largestAltitude(int* gain, int gainSize) {
    int highestAltitude = 0;
    int currentAltitude = 0;

    for (int i = 0; i < gainSize; ++i) {
        currentAltitude += gain[i];
        if (currentAltitude > highestAltitude) {
            highestAltitude = currentAltitude;
        }
    }

    return highestAltitude;
}