L1-002 打印沙漏 (20分)（Java版，带注释）_javal1-002

说是带点栈的思想？不太清楚（

import java.util.Scanner;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        int num = input.nextInt();
        String ch = input.next();
        int i = 1, sum = 1, k = 0, cnt = 0;
        int [] arr = new int[100];
        while(sum <= num){
            arr[k++] = i;
            i += 2;
            sum += i*2;

            cnt++;

        }
        cnt--;       //cnt == 2
        sum = 0;
        for (int f = 0; f <= cnt; f++){
            sum += arr[f]*2;
        }
        sum--;

        int lines = (arr[cnt] + 1)/2;       //循环行数
//        System.out.println(lines);
        int temp = cnt;
        for (int j = 0; j < lines; j++){
            int temp2 = j;
            while(temp2 != 0){
                System.out.print(' ');
                temp2--;
            }

                for (int h = 0; h < arr[temp]; h++){
                    System.out.print(ch);
                }

            if (temp == 0){

                break;
            }
            temp--;
            System.out.println();
        }
        if (lines != 1){
            System.out.println();
        }
        lines = lines - 1;                      //下层行数比上层少一
        temp = 1;
        for (int q = lines - 1; q >= 0; q--){
            int temp3 = q;
            while(temp3 != 0){
                System.out.print(' ');
                temp3--;
            }
            for (int w = 0; w < arr[temp]; w++){
                System.out.print(ch);
            }
            temp++;
            if (temp > cnt){
                break;
            }
            System.out.println();
        }
        
        System.out.println();
        System.out.println(num-sum);
        }

    }



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