zoukankan      html  css  js  c++  java
  • 牛客网 矩阵中的路径

    题目:

    解题:

    public class Solution {
        public boolean hasPath(char[] matrix, int rows, int cols, char[] str) {
            int flag[] = 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, str, 0, flag))
                        return true;
                }
            }
            return false;
        }
    
        private boolean helper(char[] matrix, int rows, int cols, int i, int j, char[] str, int k, int[] flag) {
            int index = i * cols + j;//将矩阵行列的位置换算成下标
            if (i < 0 || i >= rows || j < 0 || j >= cols || matrix[index] != str[k] || flag[index] == 1)
                return false;
            if(k == str.length - 1) return true;//刚好匹配到最后一个字符
            flag[index] = 1;
            if (helper(matrix, rows, cols, i - 1, j, str, k + 1, flag)
                    || helper(matrix, rows, cols, i + 1, j, str, k + 1, flag)
                    || helper(matrix, rows, cols, i, j - 1, str, k + 1, flag)
                    || helper(matrix, rows, cols, i, j + 1, str, k + 1, flag)) {
                return true;
            }
            flag[index] = 0;
            return false;
        }
    }
  • 相关阅读:
    概率派VS贝叶斯派
    Numpy-数组array操作
    Numpy基础
    PCA基本原理
    编程语言
    卷积神经网络基础
    IntelliJ IDEA Merge
    Mybatis 问题总结
    Lambda用法
    Map键值对取值, key是在"|"转义, value是在::取值
  • 原文地址:https://www.cnblogs.com/yanhowever/p/12312921.html
Copyright © 2011-2022 走看看