蓝桥杯JAVA直线

import java.util.*;
class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        ArrayList<Point> pointArrayList = new ArrayList<>();
        Set<Line> lines=new HashSet<>();
        for (int i = 0; i < 20; i++) {
            for (int j = 0; j < 21; j++) {
                pointArrayList.add(new Point(i, j));
            }
        }
        int ans=0;
        for (int i = 0; i < pointArrayList.size(); i++) {
            for (int j = i+1; j < pointArrayList.size(); j++) {
                double k;
                double b;
                ans++;
                if (pointArrayList.get(i).x == pointArrayList.get(j).x) {
                    continue;
                } else if (pointArrayList.get(i).y == pointArrayList.get(j).y) {
                    continue;
                } else {
                    k =  (pointArrayList.get(i).y - pointArrayList.get(j).y) / (pointArrayList.get(i).x - pointArrayList.get(j).x);
                    b = (pointArrayList.get(j).x * pointArrayList.get(i).y-pointArrayList.get(j).y*pointArrayList.get(i).x)/(pointArrayList.get(j).x-pointArrayList.get(i).x);
//                    b= pointArrayList.get(i).y-pointArrayList.get(i).x*k;
                    Line line=new Line(k,b);
                    lines.add(line);
                }
            }
        }
        System.out.println(lines.size()+20+21);
        System.out.println(ans);
    }
}

class Point {
    double x;
    double y;

    public Point(double x, double y) {
        this.x = x;
        this.y = y;
    }

    @Override
    public String toString() {
        return "Point{" +
                "x=" + x +
                ", y=" + y +
                '}';
    }
}

class Line {
    double k;
    double b;

    public Line(double k, double b) {
        this.k = k;
        this.b = b;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Line line = (Line) o;
        return k == line.k && b == line.b;
    }

    @Override
    public int hashCode() {
        return Objects.hash(k, b);
    }
}

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值