El patrón de corazón invertido del alfabeto consta de dos partes. La parte superior del patrón es un triángulo. La base del patrón tiene dos picos y un espacio entre ellos. Por lo tanto, el patrón deseado se ve como se muestra en la ilustración.
Ilustración:
A BBB CCCCC DDDDDDD EEEEEEEEE FFFFFFFFFFF GGGGGGGGGGGGG HHHHHHHHHHHHHHH IIIIIIIIIIIIIIIII JJJJJJJJJJJJJJJJJJJ KKKKKKKKKKKKKKKKKKKKK LLLLLLLLLLLLLLLLLLLLLLL MMMMMMMMMMMMMMMMMMMMMMMMM NNNNNNNNNNNNNNNNNNNNNNNNNNN OOOOOOOOOOOOOOOOOOOOOOOOOOOOO PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT UUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU VVVVVVVVVVVVVVVVV VVVVVVVVVVVVVVVVV WWWWWWWWWWWWWWW WWWWWWWWWWWWWWW XXXXXXXXXXXXX XXXXXXXXXXXXX YYYYYYYYYYY YYYYYYYYYYY ZZZZZZZZZ ZZZZZZZZZ
Acercarse:
El enfoque para imprimir el mismo es muy simple, primero nos centraremos en la mitad superior y quitaremos la mitad inferior. Entonces simplemente tenemos que imprimir el patrón de la pirámide superior donde necesitamos mantener y actualizar el conteo adicional para incrementar las letras del alfabeto. Comenzar con la letra inicial que es de tipo carácter se convierte implícitamente en un tipo entero y el incremento se transfiere con el valor ASCII correspondiente al carácter. Del mismo modo, para la mitad inferior, después de que la base se preocupe principalmente por imprimir espacios en blanco
Ejemplo
Java
// Java Program to print Alphabet Inverted Heart Pattern // Main class class GFG { // Main Method public static void main(String[] args) { // Declaring a variables to initializing with the // value to // 1. set the size of Inverted Heart int size = 39; // 2. set the size of upper part of Inverted Heart int tri_size = 20; // 3. set the size of base part of Inverted Heart int base_size = 6; // 4. set the character to be printed in first row // of pattern char a = 'A'; // Declaring and initializing variable representing // number of characters to be printed in a row int n = 1; // Upper part of the pattern for (int i = 0; i < tri_size; i++) { // Declaring variable representing white spaces // to be printed before and after triangle int spaces = (size - n) / 2; // Iterating using for loop to print spaces for (int j = 0; j < spaces; j++) { System.out.print(" "); } // Iterating using for loop to print characters for (int j = 0; j < n; j++) { System.out.print(a); } // Iterating using for loop to print spaces for (int j = 0; j < spaces; j++) { System.out.print(" "); } // By now over with one row so switching to next // row System.out.println(); n = n + 2; // Incrementing the alphabet characters // Initially at 'a' now getting to 'b' a++; } // Declaring and initializing variable representing // number of spaces to be printed in base part int spaces_end = 0; // Declaring and initializing variable representing // number of spaces to be printed between two part // of base int spaces_between = 0; // For loop to print base part for (int i = 0; i < base_size; i++) { n = (size - (2 * (spaces_end)) - spaces_between) / 2; // For loop to print space before base part-1 for (int j = 0; j < spaces_end; j++) { System.out.print(" "); } // For loop to print base part-1 for (int j = 0; j < n; j++) { System.out.print(a); } // For loop to print spaces between two base // parts for (int j = 0; j < spaces_between; j++) { System.out.print(" "); } // For loop to print base part-2 for (int j = 0; j < n; j++) { System.out.print(a); } // For loop to print spaces after base part-2 for (int j = 0; j < spaces_end; j++) { System.out.print(" "); } // Again in lowe half now done with one row // so switching to next row System.out.println(); // Similarly incrementing letter and spaces by // unity a++; spaces_end++; spaces_between = spaces_between + 2; } } }
A BBB CCCCC DDDDDDD EEEEEEEEE FFFFFFFFFFF GGGGGGGGGGGGG HHHHHHHHHHHHHHH IIIIIIIIIIIIIIIII JJJJJJJJJJJJJJJJJJJ KKKKKKKKKKKKKKKKKKKKK LLLLLLLLLLLLLLLLLLLLLLL MMMMMMMMMMMMMMMMMMMMMMMMM NNNNNNNNNNNNNNNNNNNNNNNNNNN OOOOOOOOOOOOOOOOOOOOOOOOOOOOO PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT UUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU VVVVVVVVVVVVVVVVV VVVVVVVVVVVVVVVVV WWWWWWWWWWWWWWW WWWWWWWWWWWWWWW XXXXXXXXXXXXX XXXXXXXXXXXXX YYYYYYYYYYY YYYYYYYYYYY ZZZZZZZZZ ZZZZZZZZZ
Publicación traducida automáticamente
Artículo escrito por saipranavireddyneerudu y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA