update: 添加问题“1732.找到最高海拔”的代码(并更新其题解) (#1646)

1732: AC.cpp+go+java+py+rust (#1645) + en+jp + accumulation.Phishing

cpp - AC,100.00%,57.30%
go - AC,100.00%,58.95%
java - AC,100.00%,83.62%
python - AC,100.00%,85.43%
rust - AC,100.00%,50.00%

3689: 修改入参的题解注释
#1626 (comment)
Signed-off-by: LetMeFly666 <Tisfy@qq.com>

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,10 @@
+1732: AC.cpp+go+java+py+rust (#1645) + en+jp + accumulation.Phishing
+
+cpp - AC,100.00%,57.30%
+go - AC,100.00%,58.95%
+java - AC,100.00%,83.62%
+python - AC,100.00%,85.43%
+rust - AC,100.00%,50.00%
+
+3689: 修改入参的题解注释
+https://github.com/LetMeFly666/LeetCode/pull/1626#discussion_r3382012262

Codes/1732-find-the-highest-altitude_20260619.cpp

@@ -0,0 +1,21 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-06-19 10:15:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-06-19 10:16:25
+ */
+#ifdef _DEBUG
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int largestAltitude(vector<int>& gain) {
+        int ans = 0, now = 0;
+        for (int t : gain) {
+            now += t;
+            ans = max(ans, now);
+        }
+        return ans;
+    }
+};

Codes/1732-find-the-highest-altitude_20260619.go

@@ -0,0 +1,16 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-06-19 10:15:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-06-19 10:17:13
+ */
+package main
+
+func largestAltitude(gain []int) (ans int) {
+	now := 0
+	for _, t := range gain {
+		now += t
+		ans = max(ans, now)
+	}
+	return
+}

Codes/1732-find-the-highest-altitude_20260619.java

@@ -0,0 +1,16 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-06-19 10:15:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-06-19 10:18:18
+ */
+class Solution {
+    public int largestAltitude(int[] gain) {
+        int ans = 0, now = 0;
+        for (int t : gain) {
+            now += t;
+            ans = Math.max(ans, now);
+        }
+        return ans;
+    }
+}

Codes/1732-find-the-highest-altitude_20260619.py

@@ -0,0 +1,15 @@
+'''
+Author: LetMeFly
+Date: 2026-06-19 10:15:51
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-06-19 10:19:06
+'''
+from typing import List
+
+class Solution:
+    def largestAltitude(self, gain: List[int]) -> int:
+        ans = now = 0
+        for t in gain:
+            now += t
+            ans = max(ans, now)
+        return ans

Codes/1732-find-the-highest-altitude_20260619.rs

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-06-19 10:15:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-06-19 10:19:43
+ */
+impl Solution {
+    pub fn largest_altitude(gain: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        let mut now = 0;
+        for t in gain.iter() {
+            now += t;
+            ans = ans.max(now);
+        }
+        ans
+    }
+}

Codes/lib.rs

@@ -6,7 +6,7 @@
  */
 pub struct Solution;
 
-include!("2144-minimum-cost-of-buying-candies-with-discount.rs");  // 这个fileName是会被脚本替换掉的
+include!("1732-find-the-highest-altitude_20260619.rs");  // 这个fileName是会被脚本替换掉的
 
 #[derive(Debug, PartialEq, Eq)]
 pub struct TreeNode {

Solutions/LeetCode 1732.找到最高海拔.md

@@ -1,11 +1,11 @@
 ---
-title: 1732.找到最高海拔
+title: 1732.找到最高海拔：模拟
 date: 2022-11-19 08:33:19
 tags: [题解, LeetCode, 简单, 数组, 前缀和, 模拟]
 categories: [题解, LeetCode]
 ---
 
-# 【LetMeFly】1732.找到最高海拔
+# 【LetMeFly】1732.找到最高海拔：模拟
 
 力扣题目链接：[https://leetcode.cn/problems/find-the-highest-altitude/](https://leetcode.cn/problems/find-the-highest-altitude/)
 
@@ -59,6 +59,9 @@ categories: [题解, LeetCode]
 #### C++
 
 ```cpp
+/*
+ * @LastEditTime: 2022-11-19 08:30:56
+ */
 class Solution {
 public:
     int largestAltitude(vector<int>& gain) {
@@ -73,5 +76,78 @@ public:
 };
 ```
 
+#### Python
+
+```python
+'''
+LastEditTime: 2026-06-19 10:19:06
+'''
+from typing import List
+
+class Solution:
+    def largestAltitude(self, gain: List[int]) -> int:
+        ans = now = 0
+        for t in gain:
+            now += t
+            ans = max(ans, now)
+        return ans
+
+```
+
+#### Java
+
+```java
+/*
+ * @LastEditTime: 2026-06-19 10:18:18
+ */
+class Solution {
+    public int largestAltitude(int[] gain) {
+        int ans = 0, now = 0;
+        for (int t : gain) {
+            now += t;
+            ans = Math.max(ans, now);
+        }
+        return ans;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @LastEditTime: 2026-06-19 10:17:13
+ */
+package main
+
+func largestAltitude(gain []int) (ans int) {
+    now := 0
+    for _, t := range gain {
+        now += t
+        ans = max(ans, now)
+    }
+    return
+}
+```
+
+#### Rust
+
+```rust
+/*
+ * @LastEditTime: 2026-06-19 10:19:43
+ */
+impl Solution {
+    pub fn largest_altitude(gain: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        let mut now = 0;
+        for t in gain.iter() {
+            now += t;
+            ans = ans.max(now);
+        }
+        ans
+    }
+}
+```
+
 > 同步发文于CSDN，原创不易，转载请附上[原文链接](https://blog.letmefly.xyz/2022/11/19/LeetCode%201732.%E6%89%BE%E5%88%B0%E6%9C%80%E9%AB%98%E6%B5%B7%E6%8B%94/)哦~
 > Tisfy：[https://letmefly.blog.csdn.net/article/details/127932334](https://letmefly.blog.csdn.net/article/details/127932334)

Solutions/LeetCode 3689.最大子数组总值I.md

@@ -92,7 +92,7 @@ categories: [题解, LeetCode]
 typedef long long ll;
 class Solution {
 public:
-    ll maxTotalValue(vector<int>& nums, ll k) {
+    ll maxTotalValue(vector<int>& nums, ll k) {  // 注意这里有个比较trick的方法，直接在入参把k改为了long long
         int m = nums[0], M = m;
         for (int t : nums) {
             m = min(m, t);

Solutions/Other-Accumulation-SomeTips.md

@@ -1799,6 +1799,10 @@ fn foo(x: u32)
 
 用户一升级版本，代码就炸了。
 
+### Phishing
+
+网络钓鱼，伪装成可信实体诱骗用户主动交出敏感信息或执行危险操作。
+
 # End
 
 > 同步发文于CSDN，原创不易，转载请附上[原文链接](https://blog.letmefly.xyz/2023/02/21/Other-Accumulation-SomeTips)哦~