JAVA语言程序设计第12版 3.25题

最新推荐文章于 2024-07-15 15:40:07 发布

wipeout

最新推荐文章于 2024-07-15 15:40:07 发布

阅读量265

点赞数

文章标签： java 开发语言算法

本文链接：https://blog.csdn.net/wipeout/article/details/127874173

版权

坐标计算直线交点平行线数学算法 Java编程

关键词由CSDN通过智能技术生成

package com.hspedu.single_;/*
@项目：chapter10
@功能：
@BY：思弈禾
@DATE：2022/11/15 20:50
*/

import java.util.Scanner;

public class TwentyFive {
    public static void main(String[] args) {
        Scanner input =new Scanner(System.in);
        System.out.print("Enter x1,y1,x2,y2,x3,y3,x4,y4:");
        double x1=input.nextDouble();
        double y1=input.nextDouble();
        double x2=input.nextDouble();
        double y2=input.nextDouble();
        double x3=input.nextDouble();
        double y3=input.nextDouble();
        double x4=input.nextDouble();
        double y4=input.nextDouble();
//        double a=(y1-y2);
//        double b=(x2-x1);
//        double c=(y3-y4);
//        double d=(x4-x3);
//        double e=((y1-y2)*x1-(x1-x2)*y1);
//        double f=((y3-y4)*x3-(x3-x4)*y3);
        if(((y1-y2)*(x4-x3)-(x2-x1)*(y3-y4))!=0) {
            double x=(((y1-y2)*x1-(x1-x2)*y1)*(x4-x3)-(x2-x1)*((y3-y4)*x3-(x3-x4)*y3))/((y1-y2)*(x4-x3)-(x2-x1)*(y3-y4));
            double y=((y1-y2)*((y3-y4)*x3-(x3-x4)*y3)-((y1-y2)*x1-(x1-x2)*y1)*(y3-y4))/((y1-y2)*(x4-x3)-(x2-x1)*(y3-y4));
            System.out.println("The intersecting point is at (" + x+","+ y + ")");
        }
        else {
            System.out.println("The two lines are parallel.");
        }
    }
}