petternCod/PetternProblem.java at main · anuj-C0d3/petternCod · GitHub

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
public class PetternProblem {
    public static void main(String[] args) {
        int n = 10;
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= n + 1; j++) {
                if ((i == 0 || i == n || i == n / 2) && j > 0 && j < (n + 1) / 2
                        || j == 0 && i > 0 && i < n / 2
                        || j == (n + 1) / 2 && i > n / 2 && i < n || j == 0 && i == n - 1
                        || j == (n + 1) / 2 && i == 1) {
                    System.out.print(" *");
                } else {
                    System.out.print("  ");
                }
            }
            System.out.println();
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n / 2; j++) {
                if (i == 0 || i == n / 2 || i == n - 1 || j == 0) {
                    System.out.print(" *");
                } else {
                    System.out.print("  ");
                }
            }
            System.out.println();
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n / 2; j++) {
                if (i == 0 || j == n / 4) {
                    System.out.print(" *");
                } else {
                    System.out.print("  ");
                }
            }
            System.out.println();
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n / 2; j++) {
                if (i == n - 1 && j > 0 && j < (n / 2) - 1
                        || j == 0 && i < n - 1 || j == (n / 2) - 1 && i < n - 1) {
                    System.out.print(" *");
                } else {
                    System.out.print("  ");
                }
            }
            System.out.println();
        }
    }
}