最大偶數 for qdq

0 views
Skip to first unread message

Steven_Tian

unread,
Oct 27, 2010, 5:26:11 AM10/27/10
to Good Ideas
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class FindMaxNumber {
static int number1,number2,number3;
public static void main(String[]args){
BufferedReader br = new BufferedReader(new
InputStreamReader(System.in));
int[] ints=new int[3];
try {
// Q3
System.out.println("input first number:");
number1=Integer.parseInt(br.readLine());
System.out.println("input second number:");
number2=Integer.parseInt(br.readLine());
System.out.println("input third number:");
number3=Integer.parseInt(br.readLine());
ints [0]=number1;
ints [1]=number2;
ints [2]=number3;
System.out.println("最大數="+getMaxInt(ints));
System.out.println("===============================");
// Q2
System.out.println("input one number:");
number1=Integer.parseInt(br.readLine());
System.out.println(number1%2==0?"偶數":"奇數");
System.out.println("===============================");
//Q1
System.out.println("input first number:");
number1=Integer.parseInt(br.readLine());
System.out.println("input second number:");
number2=Integer.parseInt(br.readLine());
System.out.println("input third number:");
number3=Integer.parseInt(br.readLine());
ints [0]=number1;
ints [1]=number2;
ints [2]=number3;
getMaxEven(ints);
} catch (NumberFormatException e) {
// TODO Auto-generated catch block
e.printStackTrace();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
public static int getMaxInt(int[] intArr){
int initial=0;
for(int i=0;i<intArr.length;i++){
if(intArr[i]>initial){
initial=intArr[i];
}
}
return initial;
}
public static void getMaxEvenInt(ArrayList intArr){
int initial=0;
for(int i=0;i<intArr.size();i++){
if((Integer)(intArr.get(i))>initial){
initial=(Integer)(intArr.get(i));
}
}
System.out.println("最大偶數為: "+initial);
}

public static void getMaxEven(int[] intArr){
int initial=0;
ArrayList evenAl=new ArrayList();
for(int i=0;i<intArr.length;i++){
if(intArr[i]%2==0){
evenAl.add(intArr[i]);
}
}
if(evenAl.size()>0){
getMaxEvenInt(evenAl);
}else{
System.out.println("沒有偶數");
}
}
}
Reply all
Reply to author
Forward
0 new messages