Super-150-Data_Structures/Double_Sided_Arrow_Pattern_10.java at master · codeurritesh/Super-150-Data_Structures · 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
50
51
52
53
54
55
56
import java.util.Scanner;

public class Double_Sided_Arrow_Pattern_10 {
    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        int space=n-1;
        int num=1;
        int mspace=-1;
        for (int i = 0; i < n; i++) {
            if(i==0||i==n-1)
            {
                for (int j = 0; j < space; j++) {
                    System.out.print("  ");
                }
                for (int j = num; j >0; j--) {
                    System.out.print(j+" ");
                }
                for (int j = 0; j < space; j++) {
                    System.out.print("  ");
                }
            }
            else {
                for (int j = 0; j < space; j++) {
                    System.out.print("  ");
                }
                for (int j = num; j > 0; j--) {
                    System.out.print(j + " ");
                }
                for (int j = 0; j <mspace; j++) {//Mspase
                    System.out.print("  " );
                }
                for (int j = 1; j <=num; j++) {
                    System.out.print(j+" ");
                }
                for (int j = 0; j < space; j++) {
                    System.out.print("  ");
                }
            }
            System.out.println();
            if(i>=n/2)
            {
                num--;//2
                space+=2;//4
                mspace-=2;//1

            }else
            {
            num++;//2
            space-=2;//4
            mspace+=2;//1
        }}


    }
}