华为OD机试-跳房子I-逻辑分析（JAVA 2024E卷）

/**
 * @version Ver 1.0
 * @date 2025/6/23
 * @description 跳房子I
 */
import java.util.*;

public class Test1 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextLine()) { // 注意 while 处理多个 case
            String s = in.nextLine();
            if(!s.isEmpty()){
                String substring = s.substring(1, s.length() - 1);
                int[] arrs= Arrays.stream(substring.split(",")).mapToInt(Integer::parseInt).toArray();
                int count = Integer.parseInt(in.nextLine());
                solve(arrs,count);
            }
        }
    }

    private static void solve(int[] arrs, int count) {
        StringBuilder sb = new StringBuilder();
        sb.append("[");
        //Arrays.sort(arrs);
        Map<Integer,int[]> map = new HashMap<>();
        for(int i=0;i<arrs.length-1;i++){
            for(int j=i+1;j<arrs.length;j++){
                if(arrs[i]+arrs[j]==count){
                    map.put(i+j,new int[]{arrs[i],arrs[j]});
                }
            }
        }
        map.entrySet().stream().sorted(Comparator.comparingInt(Map.Entry::getKey));
        List<int[]> collect = new ArrayList<>(map.values());
        sb.append(""+collect.get(0)[0]+","+collect.get(0)[1]);
        sb.append("]");
        System.out.println(sb);
    }
}