华为机试测试-矩阵乘法-循环

import java.util.Scanner;
public class Main{
      public static void main(String[] args){
          Scanner scanner=new Scanner(System.in);
          int row=scanner.nextInt();
          int len=scanner.nextInt();
          int column=scanner.nextInt();
          int [][] x1=new int[row][len];
          int [][] x2=new int[len][column];
          for(int i=0;i<row;i++)
          {
              for(int j=0;j<len;j++)
              {
                  x1[i][j]=scanner.nextInt();
              }
          }
          for(int i=0;i<len;i++)
          {
              for(int j=0;j<column;j++)
              {
                  x2[i][j]=scanner.nextInt();
              }
          }
          int [][]d=matrixMultity(x1, x2);
          for(int i=0;i<row;i++)
          {
              for(int j=0;j<column;j++)
              {
                  if(j==column-1)
                      System.out.print(d[i][j]);
                  else
                      System.out.print(d[i][j]+" ");
              }
              System.out.println();
          }
          scanner.close();
      } 
      
      /**
       * 
       * @param x1
       * @param x2
       * @return
       */
      public static int [][] matrixMultity(int [][] x1,int[][] x2)
      {
          int row=x1.length,column=x2[0].length;
          int len=x1[0].length;
          int [][] d=new int[row][column];
          for(int i=0;i<row;i++)
          {
              for(int j=0;j<column;j++)
              {
                  int sum=0;
                  for(int k=0;k<len;k++)
                  {
                      sum+=x1[i][k]*x2[k][j];
                  }
                  d[i][j]=sum;
              }
          }
          return d;
      }
}