Update 42. 连续子数组的最大和.md

题目链接改为力扣中的对应题目，题目描述和代码按该题的接口调整。

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);
     }