diff --git a/Patterns/Alpha_row_sqaure.java b/Patterns/Alpha_row_sqaure.java new file mode 100644 index 0000000..f0e7c97 --- /dev/null +++ b/Patterns/Alpha_row_sqaure.java @@ -0,0 +1,28 @@ + + +import java.util.Scanner; + +public class Alpha_pattern { + + public static void main(String[] args) { + //ABCD + //ABCD + //ABCD + //ABCD + Scanner s= new Scanner(System.in); + System.out.println("Enter n "); + int n = s.nextInt(); + int i=1; + while(i<=n) + { int j=1; + while(j<=n){ + + System.out.print((char)('A'+j-1)); + j=j+1; + } + System.out.println(); + i=i+1; + } + + } +} diff --git a/Patterns/Rhombus.java b/Patterns/Rhombus.java new file mode 100644 index 0000000..4d74c2c --- /dev/null +++ b/Patterns/Rhombus.java @@ -0,0 +1,44 @@ +/* +Do you want to continue?: y + +Enter the no. of rows: 5 + * * * * * + * * * * * + * * * * * + * * * * * +* * * * * +*/ +import java.util.Scanner; + + public class Rhombus + { + public static void main(String[] args) + { + outer: + while(true) + { + System.out.println(); + Scanner a = new Scanner(System.in); + char y; + System.out.print("Enter the no. of rows: "); + int r = a.nextInt(); + + for(int i=1;i<=r;i++) + { + for(int j=1;j<=r-i;j++) + { + System.out.print(" "); + } + for(int j=1;j<=r;j++) + { + System.out.print("*"+" "); + } + System.out.println(); + } + System.out.print("\nDo you want to continue?: "); + y = a.next().charAt(0); + if (y == 'N' || y == 'n') + { + break outer; + } } } } + diff --git a/Patterns/Solid_square_pattern.java b/Patterns/Solid_square_pattern.java new file mode 100644 index 0000000..7da8c2c --- /dev/null +++ b/Patterns/Solid_square_pattern.java @@ -0,0 +1,36 @@ +/* +Enter Number +4 +**** +**** +**** +**** + +*/ + +import java.util.Scanner; + +public class Pattern_1 { + + public static void main(String[] args) { + Scanner s= new Scanner(System.in); + System.out.println("Enter Number"); + int n = s.nextInt(); + int i=1; + + while(i<=n) + { int j=1; + while(j<=n) { + System.out.print("*"); + j=j+1; + } + System.out.println(); + i=i+1; + } + + + + + } + +} diff --git a/Patterns/alpha_sequence_pattern.java b/Patterns/alpha_sequence_pattern.java new file mode 100644 index 0000000..3d4f4b1 --- /dev/null +++ b/Patterns/alpha_sequence_pattern.java @@ -0,0 +1,31 @@ + + +import java.util.Scanner; + +public class Alpha_pattern_2 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + //ABCD + //BCDE + //CDEF + //DEFG + Scanner s= new Scanner(System.in); + System.out.println("Enter value of n"); + int n = s.nextInt(); + int i=1; + while(i<=n) + { char ch=(char)('A'+i-1) ; + int j=1; + while(j<=n){ + System.out.print(ch); + ch=(char)(ch+1); + j=j+1; + } + System.out.println(); + i=i+1; + } + + } + +} diff --git a/Patterns/diamond.java b/Patterns/diamond.java new file mode 100644 index 0000000..898c2ed --- /dev/null +++ b/Patterns/diamond.java @@ -0,0 +1,59 @@ +/* +Enter the number of rows: 4 +Enter symbol as you wish: +* + * + *** + ***** +******* + ***** + *** + * + */ + +import java.util.Scanner; + +public class diamond { + + public static void main(String[] args) { + + int i,j; + Scanner scan=new Scanner(System.in); + System.out.print("Enter the number of rows: "); + int rows=scan.nextInt(); + System.out.println("Enter symbol as you wish: "); + char ch=scan.next().charAt(0); + //read number input from user + i=1; + while(i<=rows){//first outer while loop iterates through the row + j=1; + while(j<=rows-i){ + System.out.print(" ");//print star + j++; + } + j=1; + while(j<=i*2-1){ + System.out.print(ch);//print given symbol + j++; + } + System.out.println();//move to next line + i++; + } + i=rows-1; + while(i>=0){//second outer while loop + j=1; + while(j<=rows-i){ + System.out.print(" ");//print space - inner wile loop + j++; + } + j=1; + while(j<=i*2-1){ + System.out.print(ch);//print given symbol - inner while loop + j++; + } + System.out.println(); + i--; + } + } + +} diff --git a/Patterns/half_astrick_pyramid.java b/Patterns/half_astrick_pyramid.java new file mode 100644 index 0000000..508391e --- /dev/null +++ b/Patterns/half_astrick_pyramid.java @@ -0,0 +1,36 @@ + + +import java.util.Scanner; + +public class pyramid_2 { + + public static void main(String[] args) { + // * + // ** + // *** + // **** + Scanner s= new Scanner(System.in); + System.out.println("Enter Height of pyramid"); + int n = s.nextInt(); + int i=1; + while(i<=n) + { + int j=1; + while(j<=n-i){ + System.out.print(" "); + j=j+1; + } + int star=1; + while(star<=i) { + System.out.print("*"); + star=star+1; + } + + System.out.println(); + i=i+1; + } + + + } + +} diff --git a/Patterns/isoceles_traingle.java b/Patterns/isoceles_traingle.java new file mode 100644 index 0000000..71c31f6 --- /dev/null +++ b/Patterns/isoceles_traingle.java @@ -0,0 +1,40 @@ + + +import java.util.Scanner; + +public class isoceles_traingle { + + public static void main(String[] args) { + // 1 + // 121 + //12321 + Scanner s= new Scanner(System.in); + System.out.println("Enter number of row"); + int n = s.nextInt(); + int i=1; + while(i<=n) + { + int j=1; + while(j<=n-i){ + System.out.print(" "); + j=j+1; + } + int num=1; + while(num<=i) { + System.out.print(num); + num=num+1; + } + int num1=i-1; + while(num1>=1) { + System.out.print(num1); + num1=num1-1; + + } + + System.out.println(); + i=i+1; + } + + } + +} diff --git a/Patterns/number_right_traingle.java b/Patterns/number_right_traingle.java new file mode 100644 index 0000000..cd35fe0 --- /dev/null +++ b/Patterns/number_right_traingle.java @@ -0,0 +1,32 @@ + + +import java.util.Scanner; + +public class traingle_pattern_2 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + //1 + //23 + //456 + //78910 + Scanner s= new Scanner(System.in); + System.out.println("Enter Height of of right angle traingle"); + int n = s.nextInt(); + int i=1; + int count=1; + while(i<=n) + { int j=1; + + while(j<=i) { + System.out.print(count); + count+=1; + j=j+1; + } + System.out.println(); + i=i+1; + } + + } + +} diff --git a/Patterns/number_row_sequence_square_pattern.java b/Patterns/number_row_sequence_square_pattern.java new file mode 100644 index 0000000..c1cfc8a --- /dev/null +++ b/Patterns/number_row_sequence_square_pattern.java @@ -0,0 +1,29 @@ + + +import java.util.Scanner; + +public class pattern_3 { + + public static void main(String[] args) { + //1234 + //1234 + //1234 + //1234 + + Scanner s= new Scanner(System.in); + System.out.println("enter width of square"); + int n = s.nextInt(); + int i=1; + + while(i<=n) + { int j=1; + while(j<=n) { + System.out.print(j); + j=j+1; + } + System.out.println(); + i=i+1; + } + } + +} diff --git a/Patterns/number_sequence_pattern.java b/Patterns/number_sequence_pattern.java new file mode 100644 index 0000000..d0d6ce4 --- /dev/null +++ b/Patterns/number_sequence_pattern.java @@ -0,0 +1,35 @@ + +import java.util.Scanner; + +public class traingle_pattern_3 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + //1 + //23 + //345 + //4567 + Scanner s= new Scanner(System.in); + System.out.println("Enter n "); + int n = s.nextInt(); + int i=1; + + while(i<=n) + { int j=1; + int count=i; + while(j<=i) { + System.out.print(count); + count+=1; + j=j+1; + + + } + System.out.println(); + + i=i+1; + } + + + } + +} diff --git a/Patterns/number_square.java b/Patterns/number_square.java new file mode 100644 index 0000000..38fe1d6 --- /dev/null +++ b/Patterns/number_square.java @@ -0,0 +1,35 @@ +/* +Enter the row number +6 +111111 +222222 +333333 +444444 +555555 +666666 +*/ + +import java.util.Scanner; + +public class Pattern_2 { + + public static void main(String[] args) { + + Scanner s= new Scanner(System.in); + System.out.println("Enter the row number"); + int n = s.nextInt(); + int i=1; + + while(i<=n) + { int j=1; + while(j<=n) { + System.out.print(i); + j=j+1; + } + System.out.println(); + i=i+1; + } + + } + +} diff --git a/Patterns/reverse_number_square.java b/Patterns/reverse_number_square.java new file mode 100644 index 0000000..c4b1606 --- /dev/null +++ b/Patterns/reverse_number_square.java @@ -0,0 +1,32 @@ +/* +54321 +54321 +54321 +54321 +54321 +*/ + +import java.util.Scanner; + +public class pattern_4 { + + public static void main(String[] args) { + // TODO Auto-generated method stub + + Scanner s= new Scanner(System.in); + System.out.println("Enter value of n"); + int n = s.nextInt(); + int i=1; + + while(i<=n) + { int j=1; + while(j<=n) { + System.out.print(n-j+1); + j=j+1; + } + System.out.println(); + i=i+1; + } + } + +} diff --git a/Patterns/reverse_pyramid.java b/Patterns/reverse_pyramid.java new file mode 100644 index 0000000..ffa96be --- /dev/null +++ b/Patterns/reverse_pyramid.java @@ -0,0 +1,31 @@ + + +import java.util.Scanner; + +public class Reverse_pyramid { + + public static void main(String[] args) { + //**** + //*** + //** + //* + Scanner s= new Scanner(System.in); + System.out.println("Enter no of row"); + int n = s.nextInt(); + int i=1; + while(i<=n) + { + int j=n; + while(j>=i){ + System.out.print("*"); + + j=j-1; + } + System.out.println(); + i=i+1; + } + + + } + +}