From edb277680b5b9e1d5118df3578c276e77bbe8831 Mon Sep 17 00:00:00 2001 From: CyC2018 Date: Wed, 28 Oct 2026 13:45:07 +0800 Subject: [PATCH] =?UTF-8?q?Update=2057.1=20=E5=92=8C=E4=B8=BA=20S=20?= =?UTF-8?q?=E7=9A=84=E4=B8=A4=E4=B8=AA=E6=95=B0=E5=AD=97.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 题目链接改为力扣中的对应题目，题目描述和代码按该题的接口调整。 --- notes/57.1 和为 S 的两个数字.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/notes/57.1 和为 S 的两个数字.md b/notes/57.1 和为 S 的两个数字.md index 2f82aac4..ddf7fedc 100644 --- a/notes/57.1 和为 S 的两个数字.md +++ b/notes/57.1 和为 S 的两个数字.md @@ -2,7 +2,7 @@ ## 题目链接 -[牛客网](https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github) +[Leetcode](https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/) ## 题目描述 @@ -17,17 +17,17 @@ - 如果 sum \< target，移动较小的元素，使 sum 变大一些。 ```java -public ArrayList FindNumbersWithSum(int[] nums, int target) { - int i = 0, j = nums.length - 1; +public int[] twoSum(int[] price, int target) { + int i = 0, j = price.length - 1; while (i < j) { - int cur = nums[i] + nums[j]; + int cur = price[i] + price[j]; if (cur == target) - return new ArrayList<>(Arrays.asList(nums[i], nums[j])); + return new int[] {price[i], price[j]}; if (cur < target) i++; else j--; } - return new ArrayList<>(); + return new int[0]; } ```