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

一次error

class Solution {
    public int largestAltitude(int[] gain) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        int sum = 0;
        list.add(sum);
        int max = 0;
        for(int i=0; i<gain.length; i++) {
        	sum += gain[i];
        	list.add(sum);
        }
        Iterator<Integer> ite = list.iterator();
        while(ite.hasNext()) {
        	if(ite.next()>max) {
        		max = ite.next();
        	}
        }
        return max;
    }
}

查阅后是

        	if(ite.next()>max) {
        		max = ite.next();
        	}

next()重复使用，游标已经失准了。

修改后

class Solution {
    public int largestAltitude(int[] gain) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        int sum = 0;
        list.add(sum);
        int max = 0;
        for(int i=0; i<gain.length; i++) {
        	sum += gain[i];
        	list.add(sum);
        }
        Iterator<Integer> ite = list.iterator();
        while(ite.hasNext()) {
        	int temp = ite.next();
        	if(temp>max) {
        		max = temp;
        	}
        }
        return max;
    }
}

AC