java用数组找最小数_Java程序,在不使用数组的情况下查找n个数字中最大和最小的数字...

我可以在不使用数组的情况下获得最大但不能得到最小的数组.

public static void main(String[] args)

{

int smallest=0;

int large=0;

int num;

System.out.println("enter the number");

Scanner input=new Scanner(System.in);

int n=input.nextInt();

for(int i=0;i

{

num=input.nextInt();

if(num>large)

{

large=num;

}

System.out.println("the largest is:"+large);

//gives the largest number in n numbers

最小的代码..

if(i==0&&num>0)

small=num;

if(num

small=num;

System.out.println(small);

}

public static void main(String[] args) {

int smallest = 0;

int large = 0;

int num;

System.out.println("enter the number");//how many number you want to enter

Scanner input = new Scanner(System.in);

int n = input.nextInt();

num = input.nextInt();

smallest = num; //assume first entered number as small one

// i starts from 2 because we already took one num value

for (int i = 2; i < n; i++) {

num = input.nextInt();

//comparing each time entered number with large one

if (num > large) {

large = num;

}

//comparing each time entered number with smallest one

if (num < smallest) {

smallest = num;

}

}

System.out.println("the largest is:" + large);

System.out.println("Smallest no is : " + smallest);

}