第一种–解析方式
class value{
public static void main(String[] args){
int[][] array=new int[2][3];
System.out.println(array[0][1]);
}
}
class value{
public static void main(String[] args){
int[][] array= {{1,3,5},{2,8,10},{2,5,6,9,8,3}};
System.out.println(array);
}
}
class value{
public static void main(String[] args){
int[][] array= {{1,3,5},{2,8,10},{2,5,6,9,8,3}};
for(int x=0;x<array.length;x++){
for(int y=0;y<array[x].length;y++){
System.out.println(array[x][y]);
}
}
}
}
class value{
public static void main(String[] args){
int[][] array= {{1,3,5},{2,8,10},{2,5,6,9,8,3}};
for(int x=0;x<array.length;x++){
for(int y=0;y<array[x].length;y++){
System.out.print(array[x][y]+" \t ");
}
System.out.println("\n");
}
}
}
利用遍历–求和二维
class good{
public static void main(String[] args){
int[][] array={{88,56,89,85,25,12},{12,25,36,89,54,62},{12,58,25,36}};
int sum=0;
for(int x=0;x<array.length;x++){
for(int y=0;y<array.length;y++){
sum +=array[x][y];
}
}
System.out.println("求和"+sum);
}
}
import java.util.Scanner;
class pinks{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
System.out.println("请输入数据");
int n=sc.nextInt();
int[][] arr=new int[n][n];
for(int x=0;x<arr.length;x++){
arr[x][0]=1;
arr[x][x]=1;
}
for(int x=0;x<arr.length;x++){
for(int y=0;y<arr[x].length;y++){
System.out.print(arr[x][y]+"");
}
System.out.println();
}
}
}