找两个数组之间各个元素与之最近的数

前提两个数组都是是有序的

public static void main(String[] args) {
        //前提是有序
        int time[]={1,5,8,11,16,17,29,34,39};
        int line[] = {3,7,12,17,19,31,40};
        Test test = new Test();
        System.out.println(test.search(line,time));
    }
    public Map<String,String> search(int line[], int time[]){
        Map<String ,String> map = new HashMap<>();
        for (int i=0;i<line.length;i++) {
            for (int j=0;j<time.length-1;j++) {
                if ((Math.abs(line[i] - time[j])) > (Math.abs(line[i] - time[j + 1])) || (Math.abs(line[i] - time[j])) == (Math.abs(line[i] - time[j + 1]))) {
                    map.put("line:" + line[i], "time:" + time[j + 1]);
                }
            }
        }
        return map;
    }

{line:19=time:17, line:17=time:17, line:7=time:8, line:40=time:39, line:3=time:5, line:12=time:11, line:31=time:29}