java输入n个整数并排序输出_求java程序：输入N个正整数，按升序排列输出，并计算最大正整数与最小数的阶层。...

满意答案

恋Ssica

2013.08.11

采纳率：41%    等级：13

已帮助：8563人

|import java.io.*;

public class Test{

public static void main(String[] args){

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

//int a[]={5,8,4,3,6,9};

int[] a;

System.out.println("输入数组的大小:");

int size=0;;

try {

size = Integer.parseInt(br.readLine());

} catch (NumberFormatException e) {

e.printStackTrace();

} catch (IOException e) {

e.printStackTrace();

}

a=new int[size];

for(int i=0;i

System.out.print("a["+i+"]=");

try {

a[i]=Integer.parseInt(br.readLine());

} catch (NumberFormatException e) {

e.printStackTrace();

} catch (IOException e) {

e.printStackTrace();

}

}

System.out.println("before sort:");

for(int i=0;i

System.out.print(" "+a[i]);

}

System.out.println();

//排序

sortArray(a);

System.out.println("aftersort:");

for(int i=0;i

System.out.print(" "+a[i]);

}

System.out.println();

//阶乘

int min=a[0];

int max=a[a.length-1];

long result1=jieCheng(min);

long result2=jieCheng(max);

if(result1!=-1){

System.out.println(min+"的阶乘为："+result1);

}

if(result2!=-1){

System.out.println(max+"的阶乘为："+result2);

}

}

/**

* 冒泡排序(升序)

*/

public static void sortArray(int[] a) {

int n = a.length;

int temp;

for (int i = 1; i <= n - 1; i++) {

for (int j = 0; j <= n - i - 1; j++) {

if (a[j] > a[j + 1]) {

temp = a[j + 1];

a[j + 1] = a[j];

a[j] = temp;

}

}

}

}

/*

* 阶乘

*/

public static long jieCheng(int k){

if(k<0){

System.out.println("负数没有阶乘。");

return -1;

}

if(k==0 || k==1){

return 1;

}

//k>=2

long result=1;

for(int i=1;i<=k;i++){

result*=i;

}

return result;

}

}

00分享举报