answer for 有關程式判斷三角形?

[Steven_Tian]

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class IdentifyTriangle {

public static void main(String[] args) {
double[] ints = new double[3];
try {
System.out.println("input first number:");
BufferedReader br = new BufferedReader(new InputStreamReader(
System.in));
ints[0] = Double.parseDouble(br.readLine());
System.out.println("input second number:");
ints[1] = Double.parseDouble(br.readLine());
System.out.println("input third number:");
ints[2] = Double.parseDouble(br.readLine());
if (isRightTriangle(ints)) {
System.out.println("直角三角形");
} else if (isTriangle(ints)) {
System.out.println("三角形");
} else {
System.out.println("無法構成三角形");
}
} catch (NumberFormatException e) {
// TODO Auto-generated catch block
e.printStackTrace();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}

private static boolean isTriangle(double[] ints) {
if (ints[0] + ints[1] > ints[2] && ints[0] + ints[2] > ints[1]
&& ints[1] + ints[2] > ints[0]&& checkNumber( ints)) {
return true;
}
return false;
}

private static boolean isRightTriangle(double[] ints) {
if ((ints[0] * ints[0] + ints[1] * ints[1] == ints[2] * ints[2]
|| ints[0] * ints[0] + ints[2] * ints[2] == ints[1] * ints[1]
|| ints[1] * ints[1] + ints[2] * ints[2] == ints[0] * ints[0])&&
checkNumber( ints)) {
return true;
}
return false;
}
private static boolean checkNumber(double[] ints){
boolean valid=true;
for(int i=0;i<ints.length;i++){
if(ints[i]<=0){
valid=false;
}
}
return valid;
}
}