面向对象程序设计上机练习一(函数重载)
Problem Description
Input
Output
Sample Input
11 22 666 44 55 11.11 22.22 33.33 888.88 55.55 1234567 222222 333333 444444 555555
Sample Output
666 888.88 1234567
import java.util.Arrays;
import java.util.Scanner;
import javax.swing.plaf.synth.SynthSpinnerUI;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
Max t = new Max();
int i;
for(i = 0; i < 5; i++)
{
t.a[i] = sc.nextInt();
}
for(i = 0; i < 5; i++)
{
t.b[i] = sc.nextFloat();
}
for(i = 0; i < 5; i++)
{
t.c[i] = sc.nextLong();
}
System.out.println(t.m(t.a));
System.out.printf("%.2f\n", t.m(t.b));
System.out.println(t.m(t.c));
sc.close();
}
}
class Max{
int a[] = new int[5];
float b[] = new float[5];
long c[] = new long[5];
public int m(int a[])
{
int max = 0, i;
for(i = 0; i < 5; i++)
{
if(max < a[i])
{
max = a[i];
}
}
return max;
}
public float m(float b[])
{
float max = 0;
int i;
for(i = 0; i < 5; i++)
{
if(max < b[i])
{
max = b[i];
}
}
return max;
}
public long m(long c[])
{
long max = 0;
int i;
for(i = 0; i < 5; i++)
{
if(max < c[i])
{
max = c[i];
}
}
return max;
}
}