LeetCode01
- 两数之和
给定一个整数数组 nums 和一个整数目标值 target,请你在该数组中找出 和 为目标值 target 的那两个整数,并返回它们的数组下标。
你可以假设每种输入只会对应一个答案。但是,数组中同一个元素在答案里不能重复出现。
你可以按任意顺序返回答案。
示例 1:
输入:nums = [2,7,11,15], target = 9
输出:[0,1]
解释:因为 nums[0] + nums[1] == 9 ,返回 [0, 1] 。
示例 2:
输入:nums = [3,2,4], target = 6
输出:[1,2]
示例 3:
输入:nums = [3,3], target = 6
输出:[0,1]
package KeepCoding.leetcode01;
public class Result01 {
public static void main(String[] args) {
int[] array01= {2,7,11,15};
int[] array02= {3,2,4};
int[] array03= {3,3};
twoSum(array01,9);
twoSum(array02,6);
twoSum(array03,6);
}
public static int[] twoSum(int[] nums,int target){
int result[] = new int[2];
for (int i = 0; i < nums.length; i++) {
for (int j = i+1; j < nums.length; j++) {
if (nums[i]+nums[j]==target){
System.out.println("["+i+","+j+"]");
result[0] = i;
result[1] = j;
return result;
}
}
}
return result;
}
}
package KeepCoding.leetcode01;
import java.util.HashMap;
public class Result02 {
public static void main(String[] args) {
int[] array01= {2,7,11,15};
int[] array02= {3,2,4};
int[] array03= {3,3};
twoSum(array01,9);
twoSum(array02,6);
twoSum(array03,6);
}
public static int[] twoSum(int[] num, int target){
int[] result = new int[2];
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < num.length; i++) {
map.put(num[i], i);
}
for (int i = 0; i < num.length; i++) {
int difference = target - num[i];
if (map.containsKey(difference) && map.get(difference)!=i){
result[0] = i;
result[1] = map.get(difference);
System.out.println("["+result[0]+","+result[1]+"]");
return result;
}
}
return result;
}
}