1. 两数之和_简答_数组

    public int[] twoSum(int[] nums, int target) {
        int array[] = new int[2];
        HashMap<Integer, Integer> hashMap = new HashMap<Integer, Integer>();
        for (int i = 0; i < nums.length; i++) {
            hashMap.put(nums[i],1);
        }
        int flag=0;
        for (int i = 0; i < nums.length; i++) {
            if (hashMap.containsKey(target-nums[i])) {
                for (int j = i+1; j < nums.length; j++) {
                    if(nums[j]==target-nums[i]){
                        array[0] = i;
                        array[1] = j;
                        flag=1;
                        break;
                    }
                }
                if(flag==1)
                break;
            }
        }
        return array;
    }