Patrón en V invertida: dado el valor de n, imprima el patrón en V invertida.
Ejemplos:
Input : n = 5
Output :
E
D D
C C
B B
A A
Input : n = 7
Output :
G
F F
E E
D D
C C
B B
A A
A continuación se muestra el programa para imprimir el patrón anterior.
C++
// C++ Implementation to print the pattern
#include <bits/stdc++.h>
using namespace std;
// Function definition
void pattern(int n)
{
int i, j, k = 0;
for (i = n - 1; i >= 0; i--) {
// outer gap loop
for (j = n - 1; j > k; j--) {
cout << " ";
}
// 65 is ASCII of 'A'
cout << char(i + 65);
// inner gap loop
for (j = 1; j < (k * 2); j++)
cout << " ";
if (i < n - 1)
cout << char(i + 65);
cout << "\n";
k++;
}
}
// Driver code
int main()
{
// taking size from the user
int n = 5;
// function calling
pattern(n);
return 0;
}
Java
// Java Implementation to print the pattern
import java.io.*;
class GFG
{
// Function definition
static void pattern(int n)
{
int i, j, k = 0;
for (i = n - 1; i >= 0; i--)
{
// outer gap loop
for (j = n - 1; j > k; j--)
{
System.out.print(" ");
}
// 65 is ASCII of 'A'
System.out.print((char)(i + 65));
// inner gap loop
for (j = 1; j < (k * 2); j++)
System.out.print(" ");
if (i < n - 1)
System.out.print((char)(i + 65));
System.out.print("\n");
k++;
}
}
// Driver code
public static void main(String args[])
{
// taking size from the user
int n = 5;
// function calling
pattern(n);
}
}
// This code is contributed by Anshika Goyal.
Python3
# Python Implementation to print
# the pattern
# Function definition
def pattern(n):
k = 0
for i in range(n - 1, -1, -1):
# outer gap loop
for j in range(n - 1, k, -1):
print(' ', end = '')
# 65 is ASCII of 'A'
print(chr(i + 65), end = '')
# inner gap loop
for j in range(1, k * 2):
print(' ', end = '')
if i<n-1:
print(chr(i + 65), end = '')
print()
k += 1
# Driver Code
# taking size from the user
n = 5
# function calling
pattern(n)
# This code is contributed
# by SamyuktaSHegde
C#
// C# Implementation to print the pattern
using System;
class GFG
{
// Function definition
static void pattern(int n)
{
int i, j, k = 0;
for (i = n - 1; i >= 0; i--)
{
// outer gap loop
for (j = n - 1; j > k; j--)
{
Console.Write(" ");
}
// 65 is ASCII of 'A'
Console.Write((char)(i + 65));
// inner gap loop
for (j = 1; j < (k * 2); j++)
Console.Write(" ");
if (i < n - 1)
Console.Write((char)(i + 65));
Console.WriteLine();
k++;
}
}
// Driver code
public static void Main()
{
// taking size from the user
int n = 5;
// function calling
pattern(n);
}
}
// This code is contributed by vt_m.
PHP
<?php
// PHP Implementation to print
// the pattern
// Function definition
function pattern($n)
{
$k = 0;
for ($i = $n - 1; $i >= 0; $i--)
{
// outer gap loop
for ($j = $n - 1; $j > $k; $j--)
{
echo " ";
}
// 65 is ASCII of 'A'
echo chr($i + 65);
// inner gap loop
for ($j = 1; $j < ($k * 2); $j++)
echo " ";
if ($i < $n - 1)
echo chr($i + 65);
echo "\n";
$k++;
}
}
// Driver code
$n = 5;
pattern($n);
// This code is contributed by mits
?>
Javascript
<script>
// JavaScript Implementation to
// print the pattern
// Function definition
function pattern(n) {
var i,
j,
k = 0;
for (i = n - 1; i >= 0; i--) {
// outer gap loop
for (j = n - 1; j > k; j--) {
document.write(" ");
}
// 65 is ASCII of 'A'
document.write(String.fromCharCode(i + 65));
// inner gap loop
for (j = 1; j < k * 2; j++)
document.write(" ");
if (i < n - 1)
document.write(String.fromCharCode(i + 65));
document.write("<br>");
k++;
}
}
// Driver code
// taking size from the user
var n = 5;
// function calling
pattern(n);
</script>
Producción:
E D D C C B B A A
Complejidad de tiempo: O(n 2 ), donde n representa la entrada dada.
Espacio auxiliar: O(1), no se requiere espacio adicional, por lo que es una constante.
Patrón V: dado el valor de n, imprima el patrón V.
Ejemplos:
Input : n = 5
Output :
E E
D D
C C
B B
A
Input : n = 7
Output :
G G
F F
E E
D D
C C
B B
A
A continuación se muestra el programa para imprimir el patrón anterior.
C++
// C++ Implementation to print the pattern
#include <bits/stdc++.h>
using namespace std;
// Function definition
void pattern(int n)
{
int i, j;
for (i = n - 1; i >= 0; i--) {
// outer gap loop
for (j = n - 1; j > i; j--) {
cout << " ";
}
// 65 is ASCII of 'A'
cout << char(i + 65);
// inner gap loop
for (j = 1; j < (i * 2); j++)
cout << " ";
if (i >= 1)
cout << char(i + 65);
cout << "\n";
}
}
// Driver code
int main()
{
// taking size from the user
int n = 5;
// function calling
pattern(n);
return 0;
}
Java
// Java Implementation to print the pattern
import java.io.*;
class GFG
{
// Function definition
static void pattern(int n)
{
int i, j;
for (i = n - 1; i >= 0; i--)
{
// outer gap loop
for (j = n - 1; j > i; j--)
{
System.out.print(" ");
}
// 65 is ASCII of 'A'
System.out.print((char)(i + 65));
// inner gap loop
for (j = 1; j < (i * 2); j++)
System.out.print(" ");
if (i >= 1)
System.out.print((char)(i + 65));
System.out.print("\n");
}
}
// Driver code
public static void main(String args[])
{
// taking size from the user
int n = 5;
// function calling
pattern(n);
}
}
// This code is contributed by Anshika Goyal.
Python3
# Python3 Implementation to print
# the pattern
import math as mt
# Function definition
def pattern(n):
i = n - 1
j = 1
for i in range(n - 1, -1, -1):
# outer gap loop
for j in range(n - 1, i, -1):
print(' ', end = '')
# 65 is ASCII of 'A'
print(chr(i + 65), end = '')
# inner gap loop
for j in range(1, i * 2):
print(' ', end = '')
if (i >= 1):
print(chr(i + 65), end = '')
print()
# Driver code
# taking size from the user
n = 5
# function calling
pattern(n)
# This code is contributed
# by MOhit kumar
C#
// C# Implementation to print the pattern
using System;
class GFG
{
// Function definition
static void pattern(int n)
{
int i, j;
for (i = n - 1; i >= 0; i--)
{
// outer gap loop
for (j = n - 1; j > i; j--)
{
Console.Write(" ");
}
// 65 is ASCII of 'A'
Console.Write((char)(i + 65));
// inner gap loop
for (j = 1; j < (i * 2); j++)
Console.Write(" ");
if (i >= 1)
Console.Write((char)(i + 65));
Console.WriteLine("");
}
}
// Driver code
public static void Main()
{
// taking size from the user
int n = 5;
// function calling
pattern(n);
}
}
// This code is contributed by vt_m.
PHP
<?php
// PHP Implementation to
// print the pattern
// Function definition
function pattern($n)
{
for ($i = $n - 1; $i >= 0; $i--)
{
// outer gap loop
for ($j = $n - 1; $j > $i; $j--)
{
echo " ";
}
// 65 is ASCII of 'A'
echo chr($i + 65);
// inner gap loop
for ($j = 1; $j < ($i * 2); $j++)
echo " ";
if ($i >= 1)
echo chr($i + 65);
echo "\n";
}
}
// Driver code
$n = 5;
pattern($n);
// This code is contributed by mits
?>
Javascript
<script>
// JavaScript Implementation to print the pattern
// Function definition
function pattern(n)
{
let i, j;
for (i = n - 1; i >= 0; i--)
{
// outer gap loop
for (j = n - 1; j > i; j--)
{
document.write(" ");
}
// 65 is ASCII of 'A'
document.write(String.fromCharCode(i + 65));
// inner gap loop
for (j = 1; j < (i * 2); j++)
document.write(" ");
if (i >= 1)
document.write(String.fromCharCode(i + 65));
document.write("<br>");
}
}
// Driver code
// taking size from the user
let n = 5;
// function calling
pattern(n);
// This code is contributed by unknown2108
</script>
Producción:
E E
D D
C C
B B
A
Complejidad de tiempo: O(n 2 ), donde n representa la entrada dada.
Espacio auxiliar: O(1), no se requiere espacio adicional, por lo que es una constante.
Publicación traducida automáticamente
Artículo escrito por nikunj_agarwal y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA