-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBasicPatterns.java
More file actions
258 lines (238 loc) · 6.04 KB
/
BasicPatterns.java
File metadata and controls
258 lines (238 loc) · 6.04 KB
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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
/**
* DSA Pattern Problems Collection
* Common pattern printing problems frequently asked in interviews
*
* @author Goutam Powar
* @version 1.0
*/
public class BasicPatterns {
/**
* Pattern: Right-aligned triangle (decreasing)
* *****
* ****
* ***
* **
* *
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void right_pattern_reverse(int n) {
for (int i = n; i > 0; i--) {
for (int j = i; j > 0; j--) {
System.out.print("*");
}
System.out.println();
}
}
/**
* Pattern: Right-aligned triangle (increasing)
* *
* **
* ***
* ****
* *****
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void right_pattern(int n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
System.out.print("*");
}
System.out.println();
}
}
/**
* Pattern: Number triangle (decreasing)
* 12345
* 1234
* 123
* 12
* 1
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void rev_num_trig(int n) {
for (int i = n; i > 0; i--) {
for (int j = 1; j <= i; j++) {
System.out.print(j);
}
System.out.println();
}
}
/**
* Pattern: Left-aligned triangle
* *
* **
* ***
* ****
* *****
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void left_trig_pattern(int n) {
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j > 0; j--) {
System.out.print(" ");
}
for (int k = 1; k <= n - i; k++) {
System.out.print("*");
}
System.out.println();
}
}
/**
* Pattern: Full pyramid/triangle
* *
* ***
* *****
* *******
* *********
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void full_pyramid_pattern(int n) {
for (int i = 0; i < n; i++) {
// Leading spaces
for (int j = 0; j < n - i - 1; j++) {
System.out.print(" ");
}
// Stars
for (int k = 0; k < 2 * i + 1; k++) {
System.out.print("*");
}
System.out.println();
}
}
/**
* Pattern: Inverted full pyramid/triangle
* *********
* *******
* *****
* ***
* *
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void full_pyramid_rev(int n) {
for (int i = n; i >= 0; i--) {
// Leading spaces
for (int j = 0; j < n - i; j++) {
System.out.print(" ");
}
// Stars
for (int k = 2 * i + 1; k > 0; k--) {
System.out.print("*");
}
System.out.println();
}
}
/**
* Pattern: Hollow rectangle
* *******
* * *
* * *
* * *
* *******
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void hollow_rect(int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == 0 || j == 0 || i == n - 1 || j == n - 1) {
System.out.print("*");
} else {
System.out.print(" ");
}
}
System.out.println();
}
}
/**
* Pattern: Diamond shape
* *
* ***
* *****
* *******
* *********
* *******
* *****
* ***
* *
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void diamond_pattern(int n) {
// Upper half of diamond
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) {
System.out.print(" ");
}
for (int k = 0; k < 2 * i + 1; k++) {
System.out.print("*");
}
System.out.println();
}
// Lower half of diamond
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < n - i - 1; j++) {
System.out.print(" ");
}
for (int k = 2 * i + 1; k > 0; k--) {
System.out.print("*");
}
System.out.println();
}
}
/**
* Pattern: Half Diamond Star Pattern
* *
* **
* ***
* ****
* *****
* ****
* ***
* **
* *
* Time Complexity: O(n²)
* Space Complexity: O(1)
*/
static void Half_Diamond_Star_Pattern(int n) {
// upper half
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
System.out.print("*");
}
System.out.println();
}
// lower half
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
System.out.print("*");
}
System.out.println();
}
}
public static void main(String[] args) {
System.out.println("=== Pattern 1: Right-aligned triangle(decreasing) ===");
right_pattern_reverse(5);
System.out.println("\n=== Pattern 2: Right-aligned triangle(increasing) ===");
right_pattern(5);
System.out.println("\n=== Pattern 3: Number Triangle(inverted) ===");
rev_num_trig(5);
System.out.println("\n=== Pattern 4: Left Triangle ===");
left_trig_pattern(5);
System.out.println("\n=== Pattern 5: Full Pyramid ===");
full_pyramid_pattern(5);
System.out.println("\n=== Pattern 6: Inverted Pyramid ===");
full_pyramid_rev(5);
System.out.println("\n=== Pattern 7: Hollow Rectangle ===");
hollow_rect(7);
System.out.println("\n=== Pattern 8: Diamond ===");
diamond_pattern(5);
System.out.println("\n=== Pattern 9: Half Diamond Star Pattern ===");
Half_Diamond_Star_Pattern(5);
}
}