FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java-Programs/Patterns/templePattern.java at master · Programing-Forks/Java-Programs · GitHub
Programing-Forks
/
Java-Programs
Public
forked from
divScorp/Java-Programs
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java-Programs
/
Patterns
/
templePattern.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
51 lines (47 loc) · 1002 Bytes
Breadcrumbs
Java-Programs
/
Patterns
/
templePattern.java
Copy path
File metadata and controls
51 lines (47 loc) · 1002 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package
Patterns
;
import
java
.
util
.
Scanner
;
/*
*
* *
* *
* * * * * * *
* *
* *
* *
* *
* *
* * * * * * *
* */
public
class
templePattern
{
public
static
void
main
(
String
[]
args
) {
Scanner
input
=
new
Scanner
(
System
.
in
);
System
.
out
.
println
(
"Enter the no.of stars: "
);
int
n
=
input
.
nextInt
();
int
point
=
n
/
2
;
for
(
int
i
=
1
;
i
<=
point
;
i
++) {
for
(
int
j
=
i
;
j
<=
point
;
j
++)
{
System
.
out
.
print
(
" "
);
}
for
(
int
j
=
1
;
j
<=(
2
*
i
-
1
);
j
++)
{
if
(
j
==
1
||
j
==(
2
*
i
-
1
))
System
.
out
.
print
(
"* "
);
else
System
.
out
.
print
(
" "
);
}
System
.
out
.
println
();
}
for
(
int
i
=
1
;
i
<=
n
;
i
++) {
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
(
""
);
}
input
.
close
();
}
}
Back
|
FazBrowse Home
|
New Git URL