力扣解题：两数之和

public class two_sum {
//解法1、暴力枚举
    public int[] twoSum(int[] nums,int target) throws IllegalAccessException {
        int len=nums.length;

        for (int i = 0; i  
//测试类
 
public class shixian_1 {
    public static void main(String[] args) throws IllegalAccessException {
        int[] nums={2,7,11,15};
        int target=9;
        int[] ints= new two_sum().twoSum(nums, target);

        for (int i = 0; i  
//解法2、哈希表记录
public class two_sum_2 {
    public int[] two(int[] nums,int target){
        int len=nums.length;
        Map hashMap=new HashMap<>(len-1);//设定哈希表长度
        hashMap.put(nums[0],0);//第一个元素肯定不是两个目标元素的最后一个，放入哈希表
        for (int i = 1; i  
public class shixian_1 {
    public static void main(String[] args) throws IllegalAccessException {
        int[] nums={2,7,11,15};
        int target=9;
        int[] ints= new two_sum().twoSum(nums, target);

        for (int i = 0; i  
public class two_sum {
//解法1、暴力枚举
    public int[] twoSum(int[] nums,int target) throws IllegalAccessException {
        int len=nums.length;

        for (int i = 0; i  
//解法2、哈希表记录
public class two_sum_2 {
    public int[] two(int[] nums,int target){
        int len=nums.length;
        Map hashMap=new HashMap<>(len-1);//设定哈希表长度
        hashMap.put(nums[0],0);//第一个元素肯定不是两个目标元素的最后一个，放入哈希表
        for (int i = 1; i  
题目链接：力扣