LeetCode - Easy - 1732. Find the Highest Altitude

古城微笑少年丶 2022-11-17 10:06 38阅读 0赞

## Topic ##

*  Array

## Description ##

[https://leetcode.com/problems/find-the-highest-altitude/][https_leetcode.com_problems_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`

## Analysis ##

略

## Submission ##

public class FindTheHighestAltitude { 
    	public int largestAltitude(int[] gain) { 
    		int max = 0, sum = 0;
    		for (int num : gain) { 
    			sum += num;
    			if (sum > max)
    				max = sum;
    		}
    		return max;
    	}
    }

## Test ##

import static org.junit.Assert.*;
    import org.junit.Test;
    
    public class FindTheHighestAltitudeTest { 
    
    	@Test
    	public void test() { 
    		FindTheHighestAltitude obj = new FindTheHighestAltitude();
    
    		assertEquals(1, obj.largestAltitude(new int[] { -5, 1, 5, 0, -7}));
    		assertEquals(0, obj.largestAltitude(new int[] { -4, -3, -2, -1, 4, 3, 2}));
    	}
    }

[https_leetcode.com_problems_find-the-highest-altitude]: https://leetcode.com/problems/find-the-highest-altitude/

发表评论取消回复

表情：

评论列表（有 0 条评论，38人围观）

还没有评论，来说两句吧...

相关阅读

相关 LeetCode - Easy - 1732. Find the Highest Altitude

Topic Array Description [https://leetcode.com/problems/find-the-highest-altitu

古城微笑少年丶/ 2022年11月17日 10:06/ 0 赞/ 39 阅读

相关 LeetCode 1732. 找到最高海拔

有一个自行车手打算进行一场公路骑行，这条路线总共由 n + 1 个不同海拔的点组成。自行车手从海拔为 0 的点 0 开始骑行。给你一个长度为 n 的整数数组 gain ，其

﹏ヽ暗。殇╰゛Y/ 2022年10月25日 12:52/ 0 赞/ 115 阅读

相关 LeetCode - Easy - 566. Reshape the Matrix

Topic Array Description [https://leetcode.com/problems/reshape-the-matrix/][ht

左手的ㄟ右手/ 2022年10月15日 00:43/ 0 赞/ 148 阅读

相关 [LeetCode][Database]Department Highest Salary

题目来源：[https://leetcode.com/problems/department-highest-salary/][https_leetcode.com_probl

灰太狼/ 2022年08月07日 12:56/ 0 赞/ 141 阅读

相关 leetcode 177. Nth Highest Salary

177. Nth Highest Salary Question Editorial Solution [My Submissions][] Total Acc

Myth丶恋晨/ 2022年07月19日 01:55/ 0 赞/ 152 阅读

相关 leetcode 176. Second Highest Salary

176. Second Highest Salary Question Editorial Solution [My Submissions][] Total

比眉伴天荒/ 2022年07月19日 01:53/ 0 赞/ 151 阅读

相关 [leetcode]--389. Find the Difference

Question 389: > Given two strings s and t which consist of only lowercase letters. > >

桃扇骨/ 2022年07月11日 14:30/ 0 赞/ 158 阅读

相关 HDU 5501 The Highest Mark

The Highest Mark Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (

爱被打了一巴掌/ 2022年06月18日 02:09/ 0 赞/ 131 阅读

相关 [leetcode]: 389. Find the Difference

1.题目描述 Given two strings s and t which consist of only lowercase letters. String t is

淡淡的烟草味﹌/ 2022年06月16日 01:24/ 0 赞/ 150 阅读

相关 leetcode 389. Find the Difference

Given two strings s and t which consist of only lowercase letters. String t is generate

浅浅的花香味﹌/ 2022年06月01日 09:12/ 0 赞/ 195 阅读