Java练习题02
2016-03-14 12:21
337 查看
问题:
编程求一个整数数组的最大值、最小值、平均值和所有元素的和。
代码:
public
class Page99{
public
static
void main(String args[]){
int NumArray[]=new
int[]{32,94,15,86,1533,-98,143,140,11,39,65};
int Average = 0;
int Sum = 0;
for(int j = 0; j < NumArray.length; j++){
for(int i = j; i < NumArray.length; i++){
if(NumArray[j] >= NumArray[i]){
int t = NumArray[i];
NumArray[i] = NumArray[j];
NumArray[j] = t;
}
}
}
for(int j = 0; j < NumArray.length; j++){
Sum = NumArray[j] + Sum;
}
Average = Sum/(NumArray.length);
System.out.print("最小值:");
System.out.println(NumArray[0]);
System.out.print("最大值:");
System.out.println(NumArray[NumArray.length-1]);
System.out.print("总
和:");
System.out.println(Sum);
System.out.print("平均值:");
System.out.print(Average);
}
};
编程求一个整数数组的最大值、最小值、平均值和所有元素的和。
代码:
public
class Page99{
public
static
void main(String args[]){
int NumArray[]=new
int[]{32,94,15,86,1533,-98,143,140,11,39,65};
int Average = 0;
int Sum = 0;
for(int j = 0; j < NumArray.length; j++){
for(int i = j; i < NumArray.length; i++){
if(NumArray[j] >= NumArray[i]){
int t = NumArray[i];
NumArray[i] = NumArray[j];
NumArray[j] = t;
}
}
}
for(int j = 0; j < NumArray.length; j++){
Sum = NumArray[j] + Sum;
}
Average = Sum/(NumArray.length);
System.out.print("最小值:");
System.out.println(NumArray[0]);
System.out.print("最大值:");
System.out.println(NumArray[NumArray.length-1]);
System.out.print("总
和:");
System.out.println(Sum);
System.out.print("平均值:");
System.out.print(Average);
}
};
相关文章推荐
- Java练习题01
- Java练习题00
- springmvc学习笔记(17)-上传图片
- JDK7中的新特性 The try-with-resources Statement
- 解决eclipse引入最新版本的v7包会遇到的问题
- spring学习笔记(3)Bean命名、定义与配置
- Dubbo与Zookeeper、SpringMVC整合和使用(负载均衡、容错)
- [已解决问题] An error occurred while automatically activating bundle com.android.ide.eclipse.adt
- java HashMap插入重复Key值问题
- 23种设计模式_java
- Eclipse启动报“fail to load the jni shared library”
- kaptcha 验证码在spring mvc 中的使用
- 2016蓝桥杯假期任务之《邮局》
- java中的集合框架List接口
- 在eclipse下的SVN插件配置忽略文件和文件夹
- Java中打jar包的方法
- 朴素贝叶斯分类器原理与java实现
- java线程基础知识
- 通过java反射,封装bean
- JAVA 字节码操作利器javassist