Java >> Java Tutorial >  >> Java

3 Rautenmuster-Programme in Java

Java


Muster 1:Rautenform bestehend aus Stern(*)


    *
   ***
  *****
 *******
*********
 *******
  *****
   ***
    *


package com.topjavatutorial;

public class DiamondPattern1 {

  public static void main(String[] args) {
    int number, i, k, count = 1;
        number = 5;
        count = number - 1;
        for (k = 1; k <= number; k++)
        {
            for (i = 1; i <= count; i++)
                System.out.print(" ");
            count--;
            for (i = 1; i <= 2 * k - 1; i++)
              System.out.print("*");
            System.out.println();
        }
        count = 1;
        for (k = 1; k <= number - 1; k++)
        {
            for (i = 1; i <= count; i++)
              System.out.print(" ");
            count++;
            for (i = 1; i <= 2 * (number - k) - 1; i++)
              System.out.print("*");
            System.out.println();
        }
  }
}

Muster 2:Rautenform bestehend aus Zahlen


   1
  212
 32123
4321234
 32123
  212
   1


package com.topjavatutorial;

public class DiamondPattern2 {

  public static void main(String[] args) {
    for (int i = 1; i <= 4; i++)
        {
            int n = 4;
 
            for (int j = 1; j <= n - i; j++)
            {
                System.out.print(" ");
            }
            for (int k = i; k >= 1; k--)
            {
              System.out.print(k);
            }
            for (int l = 2; l <= i; l++)
            {
              System.out.print(l);
            }
 
            System.out.println();
        }
 
        for (int i = 3; i >= 1; i--)
        {
            int n = 3;
 
            for (int j = 0; j <= n - i; j++)
            {
              System.out.print(" ");
            }
            for (int k = i; k >= 1; k--)
            {
              System.out.print(k);
            }
            for (int l = 2; l <= i; l++)
            {
              System.out.print(l);
            }
 
            System.out.println();
        }
   
  }
}

Muster 3:Rautenform bestehend aus Buchstaben


Enter a Char between A to Z : G
      A
     B B
    C   C
   D     D
  E       E
 F         F
G           G
 F         F
  E       E
   D     D
    C   C
     B B
      A


package com.topjavatutorial;

import java.util.Scanner;

public class DiamondPattern3 {

  public static void main(String[] args) {
    char[] letter = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J',
        'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V',
        'W', 'X', 'Y', 'Z' };
    int letter_number = 0;

    // array of strings
    String[] diamond = new String[26];
    // get the letter
    System.out.print("Enter a Char between A to Z : ");

    Scanner reader = new Scanner(System.in);
    try {
      char user_letter = reader.next("[A-Z]").charAt(0);
      // search for letter number in the array letter
      for (int i = 0; i < letter.length; i++) {
        if (letter[i] == user_letter) {
          letter_number = i;
          break;
        }
      }

      // construct diamond

      for (int i = 0; i <= letter_number; i++) {
        diamond[i] = "";
        // add initial spaces
        for (int j = 0; j < letter_number - i; j++) {
          diamond[i] += " ";
        }

        // add letter (first time)
        diamond[i] += letter[i];

        // add space between letters
        if (letter[i] != 'A') {
          for (int j = 0; j < 2 * i - 1; j++) {
            diamond[i] += " ";
          }
          // add letter (second time)
          diamond[i] += letter[i];
        }
        // Draw the first part of the diamond as it's composing.
        System.out.println(diamond[i]);
      }

      for (int i = letter_number - 1; i >= 0; i--) {
        // Draw the second part of the diamond
        // Writing the diamondArray in reverse order.
        System.out.println(diamond[i]);
      }
    } catch (Exception e) {
      // TODO Auto-generated catch block
      e.printStackTrace();
    } finally {
      reader.close();
    }

  }
}


Java-Tag