【提问】求大佬优化我的代码！洛谷P1002过河卒 递归解法java

题目如下： 

 

我的代码： 

import java.util.Scanner;

public class Main {
	static Scanner sc = new Scanner(System.in);
	static short bx = sc.nextShort();
	static short by = sc.nextShort();
	static short hx = sc.nextShort();
	static short hy = sc.nextShort();
	static int[] x = {0,-2,-1,1,2,2,1,-1,-2};
	static int[] y = {0,-1,-2,-2,-1,1,2,2,1};
	public static void main(String[] args) {
		System.out.print(num(bx,by));
	}
	static int num(int x1,int y1){
		for (int i = 0;i < 9;i++){
			if(x1 == x[i] + hx && y1 == y[i] + hy){
				return 0;
			}
		}
		if (x1 == 0 || y1 == 0){
			return 1;
		}
		return num(x1 - 1,y1) + num(x1,y1 - 1);
	}
}