Shulou(Shulou.com)05/31 Report--

This article mainly introduces the relevant knowledge of "Java how to solve the robot grid problem". Xiaobian shows you the operation process through actual cases. The operation method is simple, fast and practical. I hope this article "Java how to solve the robot grid problem" can help you solve the problem.

Question: There is a square with m rows and n columns on the map. A robot starts to move from the grid with coordinates (0,0). It can move up, down, left and right at a time, and can only move one grid at a time. However, it cannot enter the grid where the sum of row coordinates and column coordinates is greater than K. For example, when K is 16, the robot can enter square (24,19) because 2+4+1+9=16, but cannot enter square (34,28) because 3+4+2+8=17>16.

Q: How many squares can the robot reach?

Analysis:

This is a simple question that can be broken down into four parts:

1) How to calculate the sum of digits

2) Is the robot able to enter a certain grid?

3) If you can enter the grid, whether the grid in the four neighborhoods can enter,

4) Statistics can reach a total of multiple grids

1) Code

//int getDigitSum(int number){

int sum=0;//temporary variable that holds a numeric digit sum while(number){ sum+=number; number/=10; }

return sum;

}

2) Code

//Whether the robot can enter a grid is considered from three aspects://① whether it crosses the boundary, ② whether the sum of digits meets the condition, and ③ whether the neighboring grid has visited bool check (int threshold,int rows,int cols,int row,int col,bool* visit){

if(row>=0&&col>=0&&row

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.