真题题解：1-4_小华最多能得到多少克黄金

4、 小华最多能得到多少克黄金

import java.util.Scanner;
 /*
 使用递归，上下左右都走，得到最终值
 */
public class Main{
 
    public static int k;
    public static int m;
    public static int n;
    public static int res;
    public static int[][] ints;
 
    public static void main(String[] args) {
 
        Scanner sc = new Scanner(System.in);
 
        m = sc.nextInt();
        n = sc.nextInt();
        k = sc.nextInt();
 
        ints = new int[m][n];
        handle(0,0);
 
        System.out.println(res);
    }
 
    public static void handle(int x, int y){
 
        int count = jisuan( x, y);
        if(count > k || ints[x][y] == 1){
            //已经走过的，或者值大于k的直接返回
            return;
        }else {
            res ++;
        }
 
        ints[x][y] = 1;
        if(x > 0){
            //上
            handle( x-1, y);
        }
 
        if(x < m-1){
            //下
            handle( x+1, y);
        }
 
        if(y > 0){
            //左
            handle( x, y-1);
        }
 
        if(y < n-1){
            //右
            handle(x, y+1);
        }
    }
 
 
    public static int jisuan(int x, int y){
 
        int a,b,c,d;
        if(x>=10){
            String[] xs = String.valueOf(x).split("");
            a = Integer.parseInt(xs[0]);
            b = Integer.parseInt(xs[1]);
        }else {
            a = 0;
            b = x;
        }
 
        if(y>=10){
            String[] ys = String.valueOf(y).split("");
            c = Integer.parseInt(ys[0]);
            d = Integer.parseInt(ys[1]);
        }else {
            c = 0;
            d = y;
        }
 
        return a + b + c + d;
    }
 
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84