Question: 12.10 Lab8Num3 (IN JAVA) Repeat Lab8Num2, but this time with Circles Input file is called lab8.in This is lab8num2 right here Input is from a
12.10 Lab8Num3 (IN JAVA)
Repeat Lab8Num2, but this time with Circles Input file is called lab8.in
This is lab8num2 right here
Input is from a file. The input is all doubles. You are to input these doubles 2 at a time (the length and width), create a Rectangle and determine if it has the largest area. Output the Rectangle with the largest area.
import java.io.File; import java.io.FileNotFoundException; import java.util.Scanner;
public class Lab8Num2 {
public static class Rectangle { private double length, width; public Rectangle() { length=0; width=0;
} public Rectangle(double len, double wid) { length=len; width=wid;
}
public double getLength() { return length; }
public void setLength(double length) { this.length = length; }
public double getWidth() { return width; }
public void setWidth(double width) { this.width = width; } public double area() { return length*width; } public double perimeter() { return 2*(length+width); } public String toString() { return "Length: " + length + " Width: " + width; } public int compareTo(Rectangle r) { return Double.compare(area(), r.area()); } }
public static void main(String[] args) { File inFile = new File("lab8.in"); Scanner fileInput = null; try { fileInput = new Scanner(inFile); } catch (FileNotFoundException ex) { //Logger.getLogger(Lab10.class.getName()).log(Level.SEVERE, null, ex); } //get first Rectangle and make it the biggest;
if(fileInput != null) { Rectangle biggest = new Rectangle(fileInput.nextDouble(), fileInput.nextDouble()); while (fileInput.hasNextDouble()) { //get more data from file Rectangle temp = new Rectangle(fileInput.nextDouble(), fileInput.nextDouble()); //make Rectangle //see if it is bigger than biggest so far if (temp.compareTo(biggest) > 0) { biggest = temp; } //if so, it is the new biggest } System.out.println("The biggest rectangle was " + biggest); } } }
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
