From c9567120ead81233cd95c2da5a549165db71e7f7 Mon Sep 17 00:00:00 2001 From: CyC2018 Date: Wed, 28 Oct 2026 13:45:06 +0800 Subject: [PATCH] =?UTF-8?q?Update=2042.=20=E8=BF=9E=E7=BB=AD=E5=AD=90?= =?UTF-8?q?=E6=95=B0=E7=BB=84=E7=9A=84=E6=9C=80=E5=A4=A7=E5=92=8C.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 题目链接改为力扣中的对应题目，题目描述和代码按该题的接口调整。 --- notes/42. 连续子数组的最大和.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/notes/42. 连续子数组的最大和.md b/notes/42. 连续子数组的最大和.md index dce17c1e..fc5787b3 100644 --- a/notes/42. 连续子数组的最大和.md +++ b/notes/42. 连续子数组的最大和.md @@ -1,6 +1,6 @@ # 42. 连续子数组的最大和 -[NowCoder](https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github) +[Leetcode](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) ## 题目描述 @@ -9,12 +9,12 @@ ## 解题思路 ```java -public int FindGreatestSumOfSubArray(int[] nums) { - if (nums == null || nums.length == 0) +public int maxSales(int[] sales) { + if (sales == null || sales.length == 0) return 0; int greatestSum = Integer.MIN_VALUE; int sum = 0; - for (int val : nums) { + for (int val : sales) { sum = sum <= 0 ? val : sum + val; greatestSum = Math.max(greatestSum, sum); }