左上角->右下角,多少种走法
方格走法
http://www.nowcoder.com/questionTerminal/79b289947d854a759525dd937aa14762
import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); int x = sc.nextInt(); int y = sc.nextInt(); System.out.println(f(x, y)); } public static int f(int x, int y){ if(x == 0 || y == 0) return 1;//碰左墙或上墙之后就只有一种走法了 return f(x - 1, y) + f(x, y - 1);//从右下角往回倒着走,有2种倒走法 } }