矩阵中的路径

给定一个字符串矩阵matrix，和这个矩阵的rows，cols即矩阵的行数和列数。再给定一个字符串，判断这个字符串是否在这个字符串矩阵中的路径中。

public class Solution {
    public boolean hasPath(char[] matrix, int rows, int cols, char[] str){
        int[] res = new int[matrix.length];
        for(int i=0;i<rows;i++){
            for(int j=0;j<cols;j++){
                if(helper(matrix,rows,cols,i,j,0,str,res)){
                    return true;
                }
            }
        }
        return false;
    }
    public boolean helper(char[] matrix,int rows,int cols,int i,int j,int k,char[] str,int[] res){
        int index = i*cols + j;
        if(i<0 || i>=rows || j<0 || j>=cols || matrix[index] != str[k] || res[index] == 1){
            return false;
        }
        if(k == str.length-1) return true;
        res[index] = 1;
        if(helper(matrix,rows,cols,i-1,j,k+1,str,res)
           || helper(matrix,rows,cols,i+1,j,k+1,str,res)
           || helper(matrix,rows,cols,i,j - 1,k+1,str,res)
           || helper(matrix,rows,cols,i,j + 1,k+1,str,res)){
            return true;
        }
        res[index] = 0;
        return false;
    }
}