题解 | #求最小公倍数#
二维数组求和
http://www.nowcoder.com/practice/01b9b232b8894e83b1740c5513fa9488
public class Main {
public static void main(String[] args) {
int[][] arr = {{11,33,55},{22,44,66,88},{131,214,315,146},{928,827,726,625},{424,525}};
int sum=add(arr);
System.out.println(sum);
}
public static int add(int[][] arr) {
int sum=0;
//write your code herAe......
for(int i = 0 ; i < arr.length ; i++){
for(int j = 0 ; j < arr[i].length ; j++){
sum = sum + arr[i][j];
}
}
return sum;
}
}