Two sum — java

最新推荐文章于 2025-01-19 10:28:16 发布

原创最新推荐文章于 2025-01-19 10:28:16 发布 · 200 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一种解决两数之和问题的经典算法。给定一个整数数组和一个目标值，找出数组中和为目标值的两个数，并返回它们的数组下标。文章通过双层循环遍历的方法实现，确保每个元素只被使用一次。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

public class Solution {
	public int[] twoSum(int[] nums, int target) {
		for (int i = 0; i < nums.length; i++) {
			for (int j = i + 1; j < nums.length; j++) {
				if (nums[j] == target - nums[i]) {
					return new int[] { i, j };
				}
			}
		}
		throw new IllegalArgumentException("No two sum solution");
	}
}