package suanfa;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class Solution2 {
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int complement = target - nums[i];
if (map.containsKey(complement)) {
return new int[] { map.get(complement), i };
}
map.put(nums[i], i);
}
throw new IllegalArgumentException("No two sum solution");
}
public static void main(String[] args) {
int nums[] = {2, 7, 11, 15};
int target = 9;
final Solution2 solution2 = new Solution2();
int[] result = solution2.twoSum(nums,target);
//输出数组nums中两数之和为target的对应下标
System.out.println(Arrays.toString(result));
}
}
两数相加:输出数组nums中两数之和为target的对应下标(力扣算法经典完整版,拿来直接调试建议收藏)
最新推荐文章于 2023-08-25 09:14:13 发布