HighestAltitude.java

/*
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.
 */
public class HighestAltitude {
    public static void main(String[] args) {
        int[] gain={-5,1,5,0,7};
        int result=largestAltitude(gain);
        System.out.println(result);

    }
    public static int largestAltitude(int[] gain) {
        int[] ans=new int[gain.length+1];
        ans[0]=0;
        for(int i=1; i<=gain.length; i++){
            ans[i]=gain[i-1]+ans[i-1];
        }
        int max=ans[0];
        for(int i=1; i<ans.length; i++){
            if(max<ans[i]){
                max=ans[i];
            }
        }
        return max;


    }
}