|
| 1 | +package com.java.pattern; |
| 2 | + |
| 3 | +public class Pattern1 { |
| 4 | + |
| 5 | + public static void main(String[] args) { |
| 6 | + sequarPattern(5); |
| 7 | + System.out.println(); |
| 8 | + leftSideTriglePattern(5); |
| 9 | + System.out.println(); |
| 10 | + leftSideNumberTriglePattern(5); |
| 11 | + System.out.println(); |
| 12 | + leftSideSameNumberTriglePattern(5); |
| 13 | + System.out.println(); |
| 14 | + leftSideReversStarTriglePattern(5); |
| 15 | + System.out.println(); |
| 16 | + leftSideReversNumberTriglePattern(5); |
| 17 | + System.out.println(); |
| 18 | + completeUpTringle(5); |
| 19 | + System.out.println(); |
| 20 | + completeDownTringle(5); |
| 21 | + } |
| 22 | + |
| 23 | + public static void sequarPattern(int n){ |
| 24 | + for(int i=1;i<=n;i++) { |
| 25 | + for(int j=1;j<=n;j++) { |
| 26 | + System.out.print("*"); |
| 27 | + } |
| 28 | + System.out.println(); |
| 29 | + } |
| 30 | + |
| 31 | + } |
| 32 | + |
| 33 | + public static void leftSideTriglePattern(int n){ |
| 34 | + for(int i=1;i<=n;i++) { |
| 35 | + for(int j=1;j<=i;j++) { |
| 36 | + System.out.print("* "); |
| 37 | + } |
| 38 | + System.out.println(""); |
| 39 | + } |
| 40 | + } |
| 41 | + |
| 42 | + public static void leftSideNumberTriglePattern(int n) { |
| 43 | + |
| 44 | + for(int i=1;i<=n;i++) { |
| 45 | + for(int j=1;j<=i;j++) { |
| 46 | + System.out.print(j+" "); |
| 47 | + } |
| 48 | + System.out.println(); |
| 49 | + } |
| 50 | + } |
| 51 | + |
| 52 | + public static void leftSideSameNumberTriglePattern(int n) { |
| 53 | + for(int i=1;i<=n;i++) { |
| 54 | + for(int j=1;j<=i;j++) { |
| 55 | + System.out.print(i+" "); |
| 56 | + } |
| 57 | + System.out.println(); |
| 58 | + } |
| 59 | + } |
| 60 | + |
| 61 | + public static void leftSideReversStarTriglePattern(int n) { |
| 62 | + for(int i=1;i<=n;i++) { |
| 63 | + for(int j=5;j>=i;j--) { |
| 64 | + System.out.print("*"); |
| 65 | + } |
| 66 | + System.out.println(); |
| 67 | + } |
| 68 | + } |
| 69 | + |
| 70 | + public static void leftSideReversNumberTriglePattern(int n) { |
| 71 | + for(int i=5;i>=1;i--) { |
| 72 | + for(int j=1;j<=i;j++) { |
| 73 | + System.out.print(j); |
| 74 | + } |
| 75 | + System.out.println(); |
| 76 | + } |
| 77 | + } |
| 78 | + |
| 79 | + public static void completeUpTringle(int n) { |
| 80 | + for(int i=1;i<=n;i++) { |
| 81 | + for(int j=1;j<=n+i-1;j++) { |
| 82 | + if((i+j)>5) |
| 83 | + System.out.print(" * "); |
| 84 | + else |
| 85 | + System.out.print(" "); |
| 86 | + } |
| 87 | + System.out.println(); |
| 88 | + } |
| 89 | + } |
| 90 | + |
| 91 | + public static void completeDownTringle(int n) { |
| 92 | + for(int i=5;i>=1;i--) { |
| 93 | + for(int j=1;j<=i+4;j++) { |
| 94 | + if(((i+j)<=5)) { |
| 95 | + System.out.print(" "); |
| 96 | + }else { |
| 97 | + System.out.print(" * "); |
| 98 | + } |
| 99 | + } |
| 100 | + System.out.println(); |
| 101 | + } |
| 102 | + } |
| 103 | +} |
0 commit comments