常量的大坑

LeetCode上面的两数之和

package com.lixiao.demo.leetcode;

import com.alibaba.fastjson.JSONObject;

import java.util.HashMap;
import java.util.Map;

/**
 * @Author: lixiao
 * @Date: 2020/8/11 9:12
 * @Description:
 */
public class Demo1两数之和 {
        public static Map twoSum(int[] nums, int target) {
            int[] index = new int[2];
            int count = 0;
            HashMap<Integer, String> ints = new HashMap<>();
            for(int i=0;i<nums.length;i++){
             for (int j = i+1;j<nums.length;j++) {
                 if (nums[i] + nums[j] == target) {
                     index[0] = i;
                     index[1] = j;
                     //这个地方如果不转string那么后面打印的结果永远是最后一个符合条件的数组
                     String s =  JSONObject.toJSONString(index);
                     ints.put(count,s);
                     count++;
                 }

             }
            }
            return ints;
        }
    public static void main(String[] args) {
       int[] nums ={3, 1, 3, 3};
       int target = 6;
        for (int num : nums) {
            System.out.println(num);
        }
        twoSum(nums,target).forEach((k,v)-> {
            System.out.println("Item : " + k + " Count : " + v);
            System.out.println(JSONObject.toJSON(v));

        });

    }

}