分治法--一维最接近点对问题

1）问题描述

2）基本思路

3）代码实现

package hello;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class fuck {
   

    public static void main(String[] args) {
   
        Scanner scanner = new Scanner(System.in);
        int N = -1;
        
        while (N != 0) {
   
            N = scanner.nextInt();
            List<Point> points = new ArrayList<>();                     //创建列表（列表中放的是点的对象）
            for (int i = 0; i < N; i++) {
                        //把输入的点弄进列表
                Point point = new Point();
                point.setX(scanner.nextDouble());
                point.setY(scanner.nextDouble());
                points.add(point);
            }
            if(N!=0){
   
                double min = MinDistance(points);
                System.out.printf("%.2f", min