Question

编写Java小应用程序，定义一个int数组(数组元素任意指定)，求数组元素的和、最大值和最小值并输出结果。

Answer 1

public class Max {
public static void main(String[] args) {
int[] y= {0,9,4,8,2,12,444,5,-1,-22,45};
System.out.println(m(y));
System.out.println(mm(y));
System.out.println(sum(y));
}
public static int m(int[] p){
int max=0;
for (int i=0;i<p.length;i++){
if(p[i]>=max){
max=p[i];
}
}
return max;
}
public static int mm(int[] p){
int min=p[0];
for (int i=1;i<p.length;i++){
if(p[i]<=min){
min=p[i];
}
}
return min;
}
public static long sum(int[] p){
long x=0;
for (int i=0;i<p.length;i++){
x=x+p[i];
}
return x;
}
}

Answer 2

public class TestArray {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] abc = {1,3,4,5,8,9};
int result = 0;
for(int i=0;i<abc.length;i++){
result+=abc[i];
}
System.out.println("数组元素的和为："+result);

BubbleSort(abc);
System.out.println("数组元素的最大值为："+abc[0]);
System.out.println("数组元素的最小值为："+abc[abc.length-1]);

}

//冒泡排序算法(降序)
public static void BubbleSort(int[] goal){
int stmp;
for (int i = 1; i< goal.length; i++){
for(int j=0; j<i;j++){
if(goal[i]>goal[j]){
stmp=goal[i];
goal[i]=goal[j];
goal[j]=stmp;
}
}
}
}

}

Answer 3

自己做啊！