g1701_1800.s1732_find_the_highest_altitude.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1701_1800.s1732_find_the_highest_altitude;

// #Easy #Array #Prefix_Sum #2022_04_28_Time_0_ms_(100.00%)_Space_40.1_MB_(83.65%)

/**
 * 1732 - Find the Highest Altitude\.
 *
 * Easy
 *
 * 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`
**/
public class Solution {
    public int largestAltitude(int[] gain) {
        int max = 0;
        int[] altitudes = new int[gain.length + 1];
        for (int i = 0; i < gain.length; i++) {
            altitudes[i + 1] = altitudes[i] + gain[i];
            max = Math.max(max, altitudes[i + 1]);
        }
        return max;
    }
}