矩阵运算（二维数组）

package cn.bjsxt.array2;
/**
 * 
 * 矩阵加法
 * 乘法
 * @author Administrator
 *
 */
public class Matrix {
    public static void print(int[][] c){
        //打印矩阵
        for(int i=0;i<c.length;i++){
            for(int j=0;j<c.length;j++){
                System.out.print(c[i][j]+"	");
            }
            System.out.println();
        }
    }
    public static int[][] add(int[][]a,int[][]b){
        //加法
        int[][]c=new int[a.length][a.length];
        for(int i=0;i<c.length;i++){
            for(int j=0;j<c.length;j++){
                c[i][j]=a[i][j]+b[i][j];
            }
        }
        return c;
    }
    //矩阵乘法
    public static int[][] multiply(int[][]a,int[][]b){
        //加法
        int[][]c=new int[a.length][a.length];
        for(int i=0;i<c.length;i++){
            for(int j=0;j<c.length;j++){
                c[i][j]=a[i][j]*b[i][j];
            }
        }
        return c;
    }
    
    public static void main(String[] args) {
        
    
    int[][] a ={ 
                    {1,3,3},
                    {2,4,7},
                    {6,4,9}
                };
    int[][]    b = {
                    {3,3,3},
                    {2,4,7},
                    {1,5,7}
                };
    
    
        int[][]    c = add(a,b);
    
        print(c);
        System.out.println("#############################");
        
        int[][]d = multiply(a,b);
        print(d);


    }
}