注:此博客不再更新,所有最新文章将发表在个人独立博客limengting.site。分享技术,记录生活,欢迎大家关注
题目描述
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
**思路:**回溯法,当问题看起来比较复杂的时候注意代码模块化
public class Solution {
public int movingCount(int threshold, int rows, int cols) {
if (threshold < 0 || rows <= 0 || cols <= 0)
return 0;
int[] flags = new int[rows * cols];
int count = movingCountCore(threshold, rows, cols, 0, 0, flags);
return count;
}
public int movingCountCore(int threshold, int rows, int cols, int row, int col, int[] flags) {
int count = 0;
if (check(threshold, rows, cols, row, col, flags)) {
flags[row * cols + col] = 1;
count = 1 + movingCountCore(threshold, rows, cols, row - 1, col, flags)
+ movingCountCore(threshold, rows, cols, row + 1, col, flags)
+ movingCountCore(threshold, rows, cols, row, col - 1, flags)
+ movingCountCore(threshold, rows, cols, row, col + 1, flags);
}
return count;
}
public boolean check(int threshold, int rows, int cols, int row, int col, int[] flags) {
if (row >= 0 && row <= rows - 1 && col >= 0 && col <= cols - 1 && flags[row * cols + col] == 0 && getDigitSum(row) + getDigitSum(col) <= threshold)
return true;
return false;
}
public int getDigitSum(int num) {
int sum = 0;
while (num > 0) {
sum += num % 10;
num /= 10;
}
return sum;
}
}
运行时间:12ms
占用内存:9288k