1.8作业

package lianxi18;

public class lianxi18 {

public static void main(String[] args) {
// TODO 自动生成的方法存根
int[]d=new int[]{546,85,598,858,5};
//初始大小和赋值一次完成
//遍历数组  通过循环
for(int e=0;e<5;e++){
System.out.println(d[e]);
}
//foreach语句
for (int t:d){
System.out.println(t);
}
}
}

package lianxi18;

public class lianxi18 {

public static void main(String[] args) {
int[]d=new int[]{546,85,598,858,5};
for (int t:d){
System.out.println(t);
}
}
}

package lianxi18;

public class lianxi18 {

public static void main(String[] args) {
int []k={10,2,3,24,50,6};
System.out.println("输出一堆数组:");
for (int m=0;m<6;m++){
System.out.print(k[m]+",");
}
System.out.println();

int  min =k[0];
for(int j=0;j<k.length;j++){
if(min <k[j]){
min=k[j];
}
}
System.out.println("这堆数中最大的是:"+min);
}
}

package lianxi18;

public class lianxi18 {

public static void main(String[] args) {
int []g={1,2,3,4,5,6,7,8,9,10};
System.out.println("所有数字的和是");
int sum=0;
for(int h=0;h<g.length;h++){
if (h==9){
System.out.print(g[h]+"=");
}else{
System.out.print(g[h]+"+");
}
sum=sum+g[h];

}System.out.println(sum);
}
}