问快速2d数组包含2d数组

EN

A = [0, 0, 0]
    [1, 1, 2]
    [0, 3, 4]

B = [1, 2]
    [3, 4]

C = [0, 0, 0]
    [1, 1, 2]

D = [1, 1, 2]
    [9, 3, 4]

contains(A, B) // true
contanis(A, C) // true
contains(A, D) // false

public static boolean contains(int[][] a, int[][] b) {

    // search for matching first element
    // only want to search up to a-b size
    for(int ra = 0; ra <= a.length - b.length; ra++) {
        for(int ca = 0; ca <= a[0].length - b[0].length; ca++) {

            // found matching first element
            if(a[ra][ca] == b[0][0]) {
                boolean tempFound = true;

                // check matching array from starting element
                for(int rb = 0; rb < b.length; rb++) {
                    for(int cb = 0; cb < b[0].length; cb++) {
                        if(b[rb][cb] != a[ra + rb][ca + cb]) {
                            tempFound = false;
                            break;
                        }
                    }
                    if(!tempFound) break;
                }

                // found it
                if(tempFound) return true;

                // otherwise keep trying to find first matching element
            }

        }
    }

    return false;

}