Java实现用传统分治法解决矩阵相乘问题

package lily.algorithm;

import org.junit.Test;

import lily.utils.MemoryTest;

public class MatrixMultiply {

    @Test
    public void test() {
        System.out.println(MemoryTest.toMemoryInfo());

         int[][] a = {
  {1, 2, 3, 4}, {3, 4, 6, 7}, {3, 7, 6, 7}, {3, 2, 4, 8}};
         int[][] b = {
  {2, 1, 4, 3}, {6, 8, 2, 3}, {3, 4, 6, 7}, {1, 4, 8, 3}};

//        int[][] a = {
  {1, 2, 3}, {3, 4, 7}, {3, 7, 7}};
//        int[][] b = {
  {2, 1, 3}, {6, 8, 3}, {3, 4, 7}};
        int[][] c = definitionMethod(a, b);
        for (int i = 0; i < c.length; i++) {
            for (int j = 0; j < c[0].length; j++) {
                System.out.print(c[i][j]);
                System.out.print("\t");
            }
            System.out.println();
        }

        System.out.println("=======================");
        c = divideConqueMethod(a, b);
        for (int i = 0; i < c.length; i++) {
            for (int j = 0; j < c[0].length; j++) {
                System.out.print(c[i][j]);
                System.out.print("\t");
            }
            System.out.println();
        }

    }

    /**
     * 矩阵相乘定义
     * 
     * @param a
     * @param b
     * @return
     */
    public int[][] definitionMethod(int[][] a, int[][] b) {
        if (a[0].length != b.len