第三界蓝桥杯软件大赛预赛（答案二）

中间三个填空题比较简单，就省略了！

第八题：

在编写图形界面软件的时候，经常会遇到处理两个矩形的关系。

    如图【1.jpg】所示，矩形的交集指的是：两个矩形重叠区的矩形，当然也可能不存在（参看【2.jpg】）。两个矩形的并集指的是：能包含这两个矩形的最小矩形，它一定是存在的。

    本题目的要求就是：由用户输入两个矩形的坐标，程序输出它们的交集和并集矩形。

    矩形坐标的输入格式是输入两个对角点坐标，注意，不保证是哪个对角，也不保证顺序（你可以体会一下，在桌面上拖动鼠标拉矩形，4个方向都可以的）。

    输入数据格式：
x1,y1,x2,y2
x1,y1,x2,y2
    
    数据共两行，每行表示一个矩形。每行是两个点的坐标。x坐标在左，y坐标在右。坐标系统是：屏幕左上角为(0,0)，x坐标水平向右增大；y坐标垂直向下增大。

    要求程序输出格式：
x1,y1,长度,高度
x1,y1,长度,高度

    也是两行数据，分别表示交集和并集。如果交集不存在，则输出“不存在”

    前边两项是左上角的坐标。后边是矩形的长度和高度。

    例如，用户输入：
100,220,300,100    
150,150,300,300

    则程序输出：
150,150,150,70
100,100,200,200    

    例如，用户输入：
10,10,20,20
30,30,40,40

    则程序输出：
不存在
10,10,30,30


    注意：

    请仔细调试！您的程序只有能运行出正确结果的时候才有机会得分！
    
    在评卷时使用的输入数据与试卷中给出的实例数据可能是不同的。

    请把所有类写在同一个文件中，调试好后，存入与【考生文件夹】下对应题号的“解答.txt”中即可。
    
    相关的工程文件不要拷入。
    
    请不要使用package语句。
    
    源程序中只能出现JDK1.5中允许的语法或调用。不能使用1.6或更高版本。

以下是代码：

import java.util.Scanner;

public class Num8 {
    class Point{
    	public int x,y;
    	public Point (int x,int y){
    		this.x=x;
    		this.y=y;
    	}
    }
    class Rectangle{
    	public Point p1,p2,p3,p4;
    	public int width,height;
        public Rectangle(Point p1,Point p2){
        	int temp;
        	if(p1.x<p2.x&&p1.y<p2.y){
        		this.p1=new Point(p1.x,p1.y);
        		this.p2=new Point(p2.x,p2.y);
        		this.p3=new Point(p1.x,p2.y);
        		this.p4=new Point(p2.x,p1.y);
        	}
        	else if(p1.x>p2.x&&p1.y>p2.y)
    		{
    			this.p1=new Point(p2.x,p2.y);
    			this.p2=new Point(p1.x,p1.y);
    			this.p3=new Point(this.p1.x,this.p2.y);
        		this.p4=new Point(this.p2.x,this.p1.y);
    		}
        	else if(p1.x<p2.x&&p1.y>p2.y){
    			this.p4=new Point(p2.x,p2.y);
    		    this.p3=new Point(p1.x,p1.y);    		    		
    		    this.p1=new Point(this.p3.x,this.p4.y);
    		    this.p2=new Point(this.p4.x,this.p3.y);
    		}
        	else if(p1.x>p2.x&&p1.y<p2.y){
    			this.p3=new Point(p2.x,p2.y);
    			this.p4=new Point(p1.x,p1.y);
        		this.p1=new Point(this.p3.x,this.p4.y);
    		    this.p2=new Point(this.p4.x,this.p3.y);			
    		}
        	this.width=this.p2.x-this.p1.x;
    		this.height=this.p2.y-this.p1.y;
    	}
        public boolean contain(Point p){
			boolean flag=false;
        	if(p.x>=p1.x&&p.x<=p4.x&&p.y>=p1.y&&p.y<=p3.y)
        	   flag=true;
        	return flag;
        }
    }
    public void ContainTwoPoint(Rectangle r1,Rectangle r2){
    	if(r1.contain(r2.p1)&&!r1.contain(r2.p2)&&!r1.contain(r2.p3)&&r1.contain(r2.p4)){//r1包含r2中的p1、p4两个点
    		int h=r1.p3.y-r2.p1.y;
    		System.out.println(r2.p1.x+","+r2.p1.y+","+r2.width+","+h);		
    		h=r2.p3.y-r1.p1.y;
    		System.out.println(r1.p1.x+","+r1.p1.y+","+r1.width+","+h);
    	}
    	else if(r1.contain(r2.p1)&&!r1.contain(r2.p2)&&!r1.contain(r2.p3)&&r1.contain(r2.p4)){//r1包含r2中的p2、p3两个点
    		int w=r2.width;
    		int h=r2.p3.y-r1.p1.y;
    		int x=r2.p2.x-w;
    		int y=r2.p3.y-h;
    		System.out.println(x+","+y+","+w+","+h);		
    		h=r1.p3.y-r2.p1.y;
    		System.out.println(r1.p1.x+","+r2.p1.y+","+r1.width+","+h);
    	}
    	else if(r1.contain(r2.p1)&&!r1.contain(r2.p2)&&r1.contain(r2.p3)&&!r1.contain(r2.p4)){//r1包含r2中的p1、p3两个点
    		int w=r2.p4.x-r1.p1.x;
    		int h=r2.height;
    		int x=r2.p4.x-w;
    		int y=r2.p2.y-h;
    		System.out.println(x+","+y+","+w+","+h);	
    		w=r2.p4.x-r1.p1.x;
    		System.out.println(r1.p1.x+","+r1.p1.y+","+w+","+r1.height);
    	}
    	else if(!r1.contain(r2.p1)&&r1.contain(r2.p2)&&!r1.contain(r2.p3)&&r1.contain(r2.p4)){//r1包含r2中的p2、p4两个点
    		int w=r1.p4.x-r2.p1.x;
    		System.out.println(r2.p1.x+","+r2.p1.y+","+w+","+r2.height);
    		w=r1.p4.x-r2.p1.x;
    		System.out.println(r2.p1.x+","+r1.p1.y+","+w+","+r1.height);
    		
    	}
    }
    public void Compute(Rectangle r1,Rectangle r2){
    	if(r1.contain(r2.p1)&&!r1.contain(r2.p2)&&!r1.contain(r2.p3)&&!r1.contain(r2.p4)){//r1只包含一个r2中的p1点
    	    int w=r1.p2.x-r2.p1.x;
    	    int h=r1.p2.y-r2.p1.y;
    		System.out.println(r2.p1.x+","+r2.p1.y+","+w+","+h);   
    		 w=r2.p4.x=r1.p1.x;
    		 h=r2.p3.y-r1.p1.y;
    		System.out.println(r1.p1.x+","+r1.p1.y+","+w+","+h);
    	}
    	else if(!r1.contain(r2.p1)&&r1.contain(r2.p2)&&!r1.contain(r2.p3)&&!r1.contain(r2.p4)){//r1只包含一个r2中的p2点
    	    int w=r2.p2.x-r1.p1.x;
    	    int h=r2.p2.y-r1.p1.y;
    	    System.out.println(r1.p1.x+","+r1.p1.y+","+w+","+h);
    	    w=r1.p4.x-r2.p1.x;
    	    h=r1.p3.y-r2.p1.y;
    	    System.out.println(r2.p1.x+","+r2.p1.y+","+w+","+h);
    	    
    	}
    	else if(!r1.contain(r2.p1)&&!r1.contain(r2.p2)&&r1.contain(r2.p3)&&!r1.contain(r2.p4)){//r1只包含一个r2中的p3点
    	    int w=r1.p4.x-r2.p3.x;
    	    int h=r2.p3.y-r1.p4.y;
    	    int x=r1.p4.x-w;
    	    int y=r2.p3.y-h;
    	    System.out.println(x+","+y+","+w+","+h);   
    	    w=r2.p4.x-r1.p1.x;
    	    h=r1.p3.y-r2.p1.y;
    	    System.out.println(r1.p1.x+","+r2.p1.y+","+w+","+h);
    	}
    	else if(!r1.contain(r2.p1)&&!r1.contain(r2.p2)&&!r1.contain(r2.p3)&&r1.contain(r2.p4)){//r1只包含一个r2中的p4点
    	    int w=r2.p4.x-r1.p3.x;
    	    int h=r1.p3.y-r2.p4.y;
    	    int x=r2.p4.x-w;
    	    int y=r1.p3.y-h;
    	    System.out.println(x+","+y+","+w+","+h);   
    	    w=r1.p4.x-r2.p1.x;
    	    h=r2.p3.y-r1.p1.y;
    	    System.out.println(r2.p1.x+","+r1.p1.y+","+w+","+h);
    	}    	
    	else if(r1.contain(r2.p1)&&r1.contain(r2.p2)&&r1.contain(r2.p3)&&r1.contain(r2.p4)){//r1包含r2的四个顶点
    		System.out.println(r2.p1.x+","+r2.p1.y+","+r2.width+","+r2.height);
    		System.out.println(r1.p1.x+","+r1.p1.y+","+r1.width+","+r1.height);
    	}
    	else if(r2.contain(r1.p1)&&r2.contain(r1.p2)&&r2.contain(r1.p3)&&r2.contain(r1.p4)){//r2包含r1的四个顶点
    		System.out.println(r1.p1.x+","+r1.p1.y+","+r1.width+","+r1.height);
    		System.out.println(r2.p1.x+","+r2.p1.y+","+r2.width+","+r2.height);
    	}
    	else if(!r1.contain(r2.p1)&&!r1.contain(r2.p2)&&!r1.contain(r2.p3)&&!r1.contain(r2.p4)){//r1不包含r2中的任何一个顶点
    		if(r2.p1.x>=r1.p1.x&&r2.p4.x<=r1.p4.x&&r1.p1.y>=r2.p1.y&&r1.p3.y<=r2.p3.y)
    		{
    			System.out.println(r2.p1.x+","+r1.p1.y+","+r2.width+","+r1.height);
    			System.out.println(r1.p1.x+","+r2.p1.x+","+r1.width+","+r2.height);
    		}
            else if(r1.p1.x>=r2.p1.x&&r1.p4.x<=r2.p4.x&&r2.p1.y>=r1.p1.y&&r2.p3.y<=r1.p3.y)
    	 	{	
    		    System.out.println(r1.p1.x+","+r2.p1.y+","+r1.width+","+r2.height);
    		    System.out.println(r2.p1.x+","+r1.p1.y+","+r2.width+","+r1.height);
    		}
            else
    	        System.out.println("不存在");
    		    int w=Math.abs(r2.p4.x-r1.p1.x);
	    	    int h=Math.abs(r2.p3.y-r1.p1.y);
    		    if(r1.p1.x>r2.p1.x)
    		       System.out.println(r2.p1.x+","+r2.p1.y+","+w+","+h);
    		    else
    		       System.out.println(r1.p1.x+","+r1.p1.y+","+w+","+h);
    		    System.out.println();
    	}
    	ContainTwoPoint(r1,r2);
    	ContainTwoPoint(r2,r1);
    } 
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		  Num8 n=new Num8();
		  Scanner cin=new Scanner(System.in);
		  String s=cin.nextLine();
		  String arr1[]=s.split(",");	
		  Point p1=n.new Point(Integer.parseInt(arr1[0]),Integer.parseInt(arr1[1]));
		  Point p2=n.new Point(Integer.parseInt(arr1[2]),Integer.parseInt(arr1[3]));
          Rectangle r1=n.new Rectangle(p1,p2);
          
          s=cin.nextLine();
		  String arr2 []=s.split(",");	
          Point p3=n.new Point(Integer.parseInt(arr2[0]),Integer.parseInt(arr2[1]));
		  Point p4=n.new Point(Integer.parseInt(arr2[2]),Integer.parseInt(arr2[3]));
          Rectangle r2=n.new Rectangle(p3,p4);        
          n.Compute(r1,r2);
          
	}

}

貌似繁琐了点！！！