test.java

Java实现的采用分治算法的城市轮廓线程序

import java.io.*;
import java.util.*;

public class Test {    // 测试运行类
	public static void main(String[] args) {    // 主函数
		ArrayList<Point> borderlst = new ArrayList<Point>();
		ArrayList<Building> buildlst = new ArrayList<Building>();
		Building bd;
		Combine a = new Combine();
		try {    // 读取文件内容
			FileReader freader = new FileReader("data1.dat");
			BufferedReader breader = new BufferedReader(freader);
			int num = 0;
			String line;
			num = Integer.parseInt(breader.readLine());
			int begin, height, end;
			for(int i = 0; i < num; i++) {
				line = breader.readLine();
				begin = Integer.parseInt(line.substring(0, line.indexOf(" ")));
				height = Integer.parseInt(line.substring(line.indexOf(" ") + 1, line.lastIndexOf(" ")));
				end = Integer.parseInt(line.substring(line.lastIndexOf(" ") + 1, line.length()));
				bd = new Building(begin, height, end);
				buildlst.add(bd);
			}
			breader.close();
			freader.close();
		} catch (Exception e) {
			e.printStackTrace();
		}		
		try {    // 写入文件内容
			borderlst = a.combine(buildlst);
			FileWriter fwriter = new FileWriter("result1.dat");
			BufferedWriter bwriter = new BufferedWriter(fwriter);
			int dat;
			for(int i = 0; i < borderlst.size(); i++){
				dat = borderlst.get(i).getx();
				bwriter.write(Integer.toString(dat));
				bwriter.newLine();
				dat = borderlst.get(i).gety();
				bwriter.write(Integer.toString(dat));
				if(i < borderlst.size() - 1) bwriter.newLine();
			}
			bwriter.close();
			fwriter.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}