有一只地鼠不小心跑进了一个m*n的矩形田地里,假设地鼠在这块田地的初始位置为(x,y),并且每次只能向相邻的上下左右四个方向移动一步,那么在最多移动K次的情况下,有多少条路径可以逃出这片田地(一旦出去田地的边界就不能再往回走)?
下面是样例示意图:
import java.util.Scanner;
public class Main {
public static int count = 0;
public static void main(String[] arge) {
Scanner can = new Scanner(System.in);
int m = can.nextInt();
int n = can.nextInt();
int x = can.nextInt();
int y = can.nextInt();
int K = can.nextInt();
move(m, n, x, y, K);
System.out.println(count);
}
public static void move(int m, int n, int x, int y, int K) {
if (x == -1 || x == m || y == -1 || y == n) {
count++;
return;
}
if (K == 0) {
return;
}
move(m, n, x - 1, y, K - 1);
move(m, n, x + 1, y, K - 1);
move(m, n, x, y - 1, K - 1);
move(m, n, x, y + 1, K - 1);
}
}