[Java]_ch6.7_方法設計II(陣列)
public class A6 {
public static void main(String[] args) {
int A[]=new int[5];
A[0]=10;
A[2]=20;
A[4]=30;
printOne(A,"A");
int B[]= {10,0,20,0,30};
printOne(B,"B");
int C[][]=new int[4][3];
C[0][1]=100;
C[1][0]=200;
C[2][2]=300;
C[3][1]=400;
printTwo(C,"C");
int D[][]= {{111,222,333},{444,555},{666,777,888,999}};
printTwo(D,"D");
int E[]=add100(A);
printOne(E,"E");
}
public static void printOne(int A[],String name) {
System.out.println(name+"陣列長度:"+A.length);
for(int i=0;i<A.length;i++) {
System.out.println(name+"["+i+"]="+A[i]);
}
System.out.println();
}
public static void printTwo(int A[][],String name) {
System.out.println(name+"陣列列數:"+A.length);
for(int i=0;i<A.length;i++) {
System.out.print("第"+i+"列長度:\t");
for(int j=0;j<A[i].length;j++) {
System.out.print(A[i][j]+"\t");
}
System.out.println();
}
}
public static int [] add100(int A[]) {
for(int i=0;i<A.length;i++) {
A[i]=A[i]+100;
}
return A;
}
}
沒有留言:
張貼留言