[Java] 蓝桥杯BASIC-18 基础练习矩形面积交

问题描述
平面上有两个矩形，它们的边平行于直角坐标系的X轴或Y轴。对于每个矩形，我们给出它的一对相对顶点的坐标，请你编程算出两个矩形的交的面积。
输入格式
输入仅包含两行，每行描述一个矩形。
在每行中，给出矩形的一对相对顶点的坐标，每个点的坐标都用两个绝对值不超过10^7的实数表示。
输出格式
输出仅包含一个实数，为交的面积，保留到小数后两位。
样例输入
1 1 3 3
2 2 4 4
样例输出
1.00

package base18;

import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        double x1, y1, x2, y2, x3, y3, x4, y4;
        double temp;
        Scanner in = new Scanner(System.in);
        x1 = in.nextDouble();
        y1 = in.nextDouble();
        x2 = in.nextDouble();
        y2 = in.nextDouble();
        x3 = in.nextDouble();
        y3 = in.nextDouble();
        x4 = in.nextDouble();
        y4 = in.nextDouble();
        in.close();
        if (x1 > x2) {
            temp = x1;
            x1 = x2;
            x2 = temp;
        }
        if (y1 > y2) {
            temp = x1;
            x1 = x2;
            x2 = temp;
        }
        if (x3 > x4) {
            temp = x3;
            x3 = x4;
            x4 = temp;
        }
        if (y3 > y4) {
            temp = y3;
            y3 = y4;
            y4 = temp;
        }
        if ((x2 < x3 && x1 < x3) || (y2 < y3 && y1 < y3) || (x4 < x1 && x3 > x1) || (y4 < y1 && y3 < y1)) {
            System.out.println(0.00);
            return;
        }
        double a[] = {x1, x2, x3, x4};
        double b[] = {y1, y2, y3, y4};
        Arrays.sort(a);
        Arrays.sort(b);
        double area = (a[2] - a[1]) * (b[2] - b[1]);
        System.out.printf("%.2f", area);
    }
}

package base18;

import java.util.Arrays;

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

double x1, y1, x2, y2, x3, y3, x4, y4;

double temp;

Scanner in = new Scanner(System.in);

x1 = in.nextDouble();

y1 = in.nextDouble();

x2 = in.nextDouble();

y2 = in.nextDouble();

x3 = in.nextDouble();

y3 = in.nextDouble();

x4 = in.nextDouble();

y4 = in.nextDouble();

in.close();

if (x1 > x2) {

temp = x1;

x1 = x2;

x2 = temp;

}

if (y1 > y2) {

temp = x1;

x1 = x2;

x2 = temp;

}

if (x3 > x4) {

temp = x3;

x3 = x4;

x4 = temp;

}

if (y3 > y4) {

temp = y3;

y3 = y4;

y4 = temp;

}

if ((x2 < x3 && x1 < x3) || (y2 < y3 && y1 < y3) || (x4 < x1 && x3 > x1) || (y4 < y1 && y3 < y1)) {

System.out.println(0.00);

return;

}

double a[] = {x1, x2, x3, x4};

double b[] = {y1, y2, y3, y4};

Arrays.sort(a);

Arrays.sort(b);

double area = (a[2] - a[1]) * (b[2] - b[1]);

System.out.printf("%.2f", area);

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版