数组最大值,最小值,和

简介

编写方法，实现求一组数字的最和值

编写方法，实现求一组数字的最大值

编写方法，实现求一组数字的最小值

调用方法输出结果 

代码1.:

public class F3 {
//求和
public static int sum(int...n){
int sum=0;
//遍历数组
for (int t:n){
sum+=t;
}
return sum;
}

//最大值
public static int max(int...n){
int max=0;
int imax=0;
//遍历数组
for (int i = 0; i < n.length-1; i++) {
for (int j = 0; j < n.length-1-i; j++) {
if (n[j]>n[j+1]){
if (n[j]>max){
imax=j;
max=n[j];
}
}else{
if (n[j+1]>max){
imax=j+1;
max=n[j+1];
}
}

}
}
return max;
}

public static int min(int...n){
int min=0;
int imin=0;
//遍历数组
for (int i = 0; i < n.length-1; i++) {
for (int j = 0; j < n.length-1-i; j++) {
if (n[j]>n[j+1]){
if (n[j]>min){
imin=j;
min=n[j];
}
}else{
if (n[j+1]>min){
imin=j+1;
imin=n[j+1];
}
}

}
}
return min;
}
public static void main(String[] args) {
//求一群数组的和
int []hh={4,63,723,7,236,3,5,754,63};
System.out.println(sum(hh));
//最大值
int []sd={455,45,34,345,2,45,5,45,4546,4,6};
System.out.println(max(sd));
//最小值
int []kk={345,45,25,646,25,67,521,34,65,};
System.out.println(min(kk));
}
}

代码二:

public class F3 {
//求和
     public static int sum(int...n){
          int sum=0;
          //遍历数组
          for (int t:n){
               sum+=t;
          }
          return sum;
     }
     //最大值
     public static int max(int...n){
          int max=0;
          if (n.length>0){
               max=n[0];
          }
          //遍历数组
          for (int t:n){
            max=Math.max(max,t);

          }
          return max;
     }

//最小值
     public static int min(int...n){
          int min=0;
          if (n.length>0){
               min=n[0];
          }
          //遍历数组
          for (int t:n){
               min=Math.min(min,t);

          }
          return min;
     }
   
    public static void main(String[] args) {
          //求一群数组的和
         int []hh={4,63,723,7,236,3,5,754,63};
         System.out.println(sum(hh));
         //最大值
             int []sd={455,45,34,345,2,45,5,45,4546,4,6};
         System.out.println(max(sd));
         //最小值
         int []kk={345,45,25,646,25,67,521,34,65,};
         System.out.println(min(kk));
    }
}