本文共 1959 字，大约阅读时间需要 6 分钟。

矩阵中的路径

import java.util.*;public class Solution {
       public boolean hasPath(char[] matrix, int rows, int cols, char[] str)    {        if(matrix==null || matrix.length==0 || str==null || str.length==0 || matrix.length!=rows*cols || rows<=0 || cols<=0 || rows*cols < str.length) {            return false ;        }        boolean[] visited = new boolean[rows*cols] ;        int[] pathLength = {
  0} ;        for(int i=0 ; i<=rows-1 ; i++) {            for(int j=0 ; j<=cols-1 ; j++) {                if(hasPathCore(matrix, rows, cols, str, i, j, visited, pathLength)) { return true ; }            }        }        return false ;    }    public boolean hasPathCore(char[] matrix, int rows, int cols, char[] str, int row, int col, boolean[] visited, int[] pathLength) {        boolean flag = false ;        if(row>=0 && row
   
    =0 && col
   

机器人的运动范围

public class Solution {
       public int movingCount(int threshold, int rows, int cols)    {        boolean[] visited=new boolean[rows*cols];        return movingCountCore(threshold, rows, cols, 0,0,visited);    }    private int movingCountCore(int threshold, int rows, int cols,            int row,int col,boolean[] visited) {        if(row<0||row>=rows||col<0||col>=cols) return 0;        int i=row*cols+col;        if(visited[i]||!checkSum(threshold,row,col)) return 0;        visited[i]=true;        return 1+movingCountCore(threshold, rows, cols,row,col+1,visited)                +movingCountCore(threshold, rows, cols,row,col-1,visited)                +movingCountCore(threshold, rows, cols,row+1,col,visited)                +movingCountCore(threshold, rows, cols,row-1,col,visited);    }    private boolean checkSum(int threshold, int row, int col) {        int sum=0;        while(row!=0){            sum+=row%10;            row=row/10;        }        while(col!=0){            sum+=col%10;            col=col/10;        }        if(sum>threshold) return false;        return true;    }}

源代码：

转载地址：http://thrin.baihongyu.com/