DSA/MyFirstClass.java at master · Mohammed-Anwar-Uddin/DSA · 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
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
import java.util.*;

public class MyFirstClass {

    public static int factorial(int n){
        int f = 1;
        for (int i=1;i<=n;i++){
            f *= i;
        }
        return f;
    }
    public static int binaryToDecimal(int binaryNum){
        int pow = 0;
        int dec = 0;
        while(binaryNum > 0){
            int lastDgt = binaryNum % 10;
            dec = dec + (lastDgt * (int)Math.pow(2, pow));
            pow++;
            binaryNum /= 10;
        }
        return dec;
    }
    public static int decimalToBinary(int n){
        int pow = 0;
        int decimal = 0;

        while (n > 0) {
            int remainder = n % 2;
            System.out.println(remainder);
            decimal = decimal + (remainder * (int)Math.pow(10, pow));
            pow++;
            n = n/2;
        }
        return decimal;
    }
    public static void printHollowRectangle(int rows, int cols){
        for(int i=1;i<=rows;i++){
            for(int j=1;j<=cols;j++){
                if(i==1 || i == rows || j == 1 || j == cols){
                    System.out.print("*");
                }else{
                    System.out.print(" ");
                }
            }
            System.out.println();
        }
    }
    public static void printInvertedHalfPyramid(int n){
        for (int i=1;i<=n;i++){
            for(int j=1;j<=n-i;j++){
                System.out.print(" ");
            }
            for (int j=1;j<=i;j++){
                System.out.print("*");
            }
            System.out.println();
        }
    }
    public static void printInvertedHalfpyramidwithNumbers(int n){
        for (int i=1;i<=n;i++){
            for (int j=1;j<=n-i+1;j++){
                System.out.print(j+" ");
            }
            System.out.println();
        }
    }
    public static void printFloydTraingle(int n){
        int count = 1;
        for(int i=1; i<=n; i++){
            if(count >= n) break;
            for (int j=1;j<=i;j++){
                System.out.print(count + " ");
                count++;
            }
            System.out.println();
        }
    }
    public static void zeroOneTrainglePattern(int n){
        for(int i=1;i<=n;i++){
            for (int j=1;j<=i;j++){
                if((i+j) % 2 == 0){
                    System.out.print("1");
                }else{
                    System.out.print("0");
                }
            }
            System.out.println();
        }
    }
    public static void butterflyPattern(int n){
        for (int i=1;i<=n;i++){

          for (int row = 1; row <= 1; row++) {
            for(int j=1; j<=i;j++){
                System.out.print("*");
            }
            for(int k=1; k<=(n-i)*2;k++){
                System.out.print(" ");
            }
            for(int l=1; l<=i;l++){
                System.out.print("*");
            }
        }


                System.out.println();

        }
                for (int i=1;i<=n;i++){
                     for (int row = 1; row <= 1; row++) {
            for(int j=1; j<=n-i;j++){
                System.out.print("*");
            }
            for(int k=1; k<=(i-1)*2+2;k++){
                System.out.print(" ");
            }
            for(int l=1; l<=n-i;l++){
                System.out.print("*");
            }
        }
        System.out.println();
    }

    }
    public static void solidRhombus(int n){
        for (int i=1;i<=n;i++){
            for (int j=1;j<=(n-i)+1;j++){
                System.out.print(" ");
            }
            for(int k=1;k<=n;k++){
                System.out.print("*");
            }
            System.out.println();
        }
    }
    public static void hollowRhombus(int n){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n-i;j++){
                System.out.print(" ");
            }
            for(int j=1;j<=n;j++){
                if(i==1 || i ==n || j==1 || j==n){
                    System.out.print("*");
                }else{
                    System.out.print(" ");
                }
            }
            System.out.println();
        }
    }
    public static void diamondPattern(int n){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n-i;j++){
                System.out.print(" ");
            }
            for(int j=1;j<=2*i-1;j++){
                System.out.print("*");
            }
            System.out.println();
        }
        for(int i=n;i>=1;i--){
            for(int j=1;j<=n-i;j++){
                System.out.print(" ");
            }
            for(int j=1;j<=2*i-1;j++){
                System.out.print("*");
            }
            System.out.println();
        }
    }
    public static void numbersPyramid(int n){
        for (int i=1;i<=n;i++){
            for(int j=1;j<=(n-i);j++){
                System.out.print(" ");
            }
            for(int j=1;j<=i;j++){
                System.out.print(" "+ i);
            }
            System.out.println();
        }
    }
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        butterflyPattern(7);


        sc.close();
    }
}