File size: 7,453 Bytes
c574d3a |
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 |
package com.sujalsamai.Pattern;
import java.util.Scanner;
public class Pattern {
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
System.out.print("Enter the number of rows: ");
int n= sc.nextInt();
rectangle(n);
//can use any of the below functions in place of rectangle
}
static void rectangle(int n){
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void rightTriangle(int n){
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void invertRightTraingle(int n){
for (int i = 1; i <= n; i++) {
for (int j = 1; j <=n-i+1 ; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void numberRightTri(int n){
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(j);
}
System.out.println();
}
}
static void rotatedTri(int n){
for (int i = 1; i <= 2*n; i++) {
int totalcolumns= i>n? 2*n- i: i;
for (int j = 1; j < totalcolumns; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void mirroRightTri(int n){
for (int i = 0; i < n; i++) {
for (int j = 2*(n-i); j >=0; j--) {
System.out.print(" ");
}
for (int j = 0; j <=i ; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void invertMirrorRight(int n){
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
System.out.print(" ");
}
for (int j = 1; j < n-i+1; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void pyramid(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();
}
}
static void invertPyramid(int n){
for (int i = 1; i <=n; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(" ");
}
for (int j = 1; j <2*((n+1)-i) ; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void triangle(int n){
for (int i = 0; i <n; i++) {
for (int j = n-i; j >1 ; j--) {
System.out.print(" ");
}
for (int j = 0; j <= i; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void invertTriangle(int n){
for (int i = 1; i <=n ; i++) {
for (int j = 1; j <=i ; j++) {
System.out.print(" ");
}
for (int j = 1; j <=n-i+1 ; j++) {
System.out.print("* ");
}
System.out.println();
}
}
static void hourglass(int n){
for (int i = 1; i <=2*n ; i++) {
if(i>n){
for (int j = 1; j <=n-(i-n) ; j++) {
System.out.print(" ");
}
for (int j = 1; j <= i-n; j++) {
System.out.print("* ");
}
}else{
for (int j = 0; j <i ; j++) {
System.out.print(" ");
}
for (int j = 0; j <n-i+1 ; j++) {
System.out.print("* ");
}
}
System.out.println();
}
}
static void hollowTraingle(int n) {
for (int i = 1; i <= n; i++) // row=6
{
// Print spaces
for (int j = i; j < n; j++) {
System.out.print(" ");
}
for (int k = 1; k < 2 * i; k++) {//print *
if (i == n || (k == 1 || k == 2 * i - 1))
System.out.print("* ");
else {
System.out.print(" ");
}
}
System.out.println();
}
}
static void invertHollowTri(int n){
for (int i = 1; i <=n ; i++) {
for (int j = 1; j < i; j++) {
System.out.print(" ");
}
for (int k = 1; k<2*n ; k++) {
if(i==1 || (k==1 || k==2*(n-i)+1)){
System.out.print("* ");
}else{
System.out.print(" ");
}
}
System.out.println();
}
}
static void hollowDiamond(int n) {
// for first half portion (top to bottom)
for(int i=1; i <= n; i++) {
for(int j = i; j <= n; j++) {
System.out.print(" ");
}
for(int k = 1; k <= 2*i-1; k++) {
if (k == 1 || k == (2 * i - 1))
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
// for second half portion
for(int i=n-1; i >= 1; i--) {
for(int j=n; j >= i; j--) {
System.out.print(" ");
}
for(int k=1; k <= 2*i-1; k++) {
if(k==1 || k==(2*i-1) )
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
static void pascal(int n){
for (int line = 1; line <=n ; line++) {
for (int j = 0; j <=n-line ; j++) {
System.out.print(" ");
}
int el=1;
for (int i = 1; i <=line ; i++) {
System.out.print(el+" ");
el=el*(line-i)/i;
}
System.out.println();
}
}
}
|