Programa para patrón triangular (imagen especular alrededor de 0)

Dado el valor de n, imprima el patrón.
Ejemplos: 
 

Input : n = 5
Output : 
    0
   101
  21012
 3210123
432101234

Input : n = 7
Output : 
      0
     101
    21012
   3210123
  432101234
 54321012345
6543210123456

A continuación se muestra el programa para imprimir el patrón anterior. 
 

// C++ Implementation to print the pattern
#include <bits/stdc++.h>
using namespace std;
 
// Function definition
void print(int n)
{
    int var1 = 1, var2 = 1;
 
    // Outer for loop to keep
    // track of number of lines
    for (int i = 0; i < n; i++) {
        // for loop to keep track
        // of spaces
        for (int j = n - 1; j > i; j--) {
            cout << " ";
        }
 
        // for loop to print the
        // digits in pattern
        for (int k = 1; k <= var1; k++) {
            cout << abs(k - var2);
        }
 
        var1 += 2;
        var2++;
        cout << "\n";
    }
}
 
// Driver code
int main()
{
    // taking size from the user
    int n = 5;
 
    // function calling
    print(n);
     
    return 0;
}

// Java Implementation to print the pattern
 
class GFG
{
    // Function definition
    static void print(int n)
    {
        int var1 = 1, var2 = 1;
     
        // Outer for loop to keep
        // track of number of lines
        for (int i = 0; i < n; i++)
        {
            // for loop to keep track
            // of spaces
            for (int j = n - 1; j > i; j--)
            {
                System.out.print(" ");
            }
     
            // for loop to print the
            // digits in pattern
            for (int k = 1; k <= var1; k++)
            {
                System.out.print(Math.abs(k - var2));
            }
     
            var1 += 2;
            var2++;
            System.out.println();
        }
    }
     
    // Driver code
    public static void main (String[] args)
    {
        // taking size from the user
        int n = 5;
     
        // function calling
        print(n);
    }
}
 
// This code is contributed by Anant Agarwal.

# Python Implementation to
# print the pattern
 
# Function definition
def printt(n):
 
    var1 = 1
    var2 = 1
  
    # Outer for loop to keep
    # track of number of lines
    for i in range(n):
 
        # for loop to keep track
        # of spaces
        for j in range(n - 1,i,-1):
            print(" ", end = "")
 
        # for loop to print the
        # digits in pattern
        for k in range(1, var1 + 1):
            print(abs(k - var2), end="")
         
        var1 += 2
        var2 += 1
        print()
 
# Driver code
# taking size from the user
n = 5
  
# function calling
printt(n)
 
# This code is contributed
# by Anant Agarwal.

//C# Implementation to print the pattern
using System;
class GFG
{
    // Function definition
    static void print(int n)
    {
        int var1 = 1, var2 = 1;
     
        // Outer for loop to keep
        // track of number of lines
        for (int i = 0; i < n; i++)
        {
            // for loop to keep track
            // of spaces
            for (int j = n - 1; j > i; j--)
            {
                Console.Write(" ");
            }
     
            // for loop to print the
            // digits in pattern
            for (int k = 1; k <= var1; k++)
            {
            Console.Write(Math.Abs(k - var2));
            }
     
            var1 += 2;
            var2++;
            Console.WriteLine();
        }
    }
     
    // Driver code
    public static void Main ()
    {
        // taking size from the user
        int n = 5;
     
        // function calling
        print(n);
    }
}
 
// This code is contributed by vt_m.

<?php
// PHP Implementation to
// print the pattern
 
// Function definition
function print1($n)
{
    $var1 = 1;
    $var2 = 1;
 
    // Outer for loop to keep
    // track of number of lines
    for ($i = 0; $i < $n; $i++)
    {
        // for loop to keep track
        // of spaces
        for ($j = $n - 1; $j > $i; $j--)
        {
            echo " ";
        }
 
        // for loop to print the
        // digits in pattern
        for ($k = 1; $k <= $var1; $k++)
        {
            echo abs($k - $var2);
        }
 
        $var1 += 2;
        $var2++;
        echo "\n";
    }
}
 
// Driver code
$n = 5;
print1($n);
 
// This code is contributed by mits
?>

<script>
// javascript Implementation to print the pattern
 
// Function definition
function print( n)
{
    let var1 = 1, var2 = 1;
 
    // Outer for loop to keep
    // track of number of lines
    for (let i = 0; i < n; i++)
    {
     
        // for loop to keep track
        // of spaces
        for (let j = n - 1; j > i; j--)
        {
           document.write("  ");
        }
 
        // for loop to print the
        // digits in pattern
        for (let k = 1; k <= var1; k++) {
            document.write(Math.abs(k - var2));
        }
 
        var1 += 2;
        var2++;
        document.write("<br/>");
    }
}
 
// Driver code
 
    // taking size from the user
    let n = 5;
 
    // function calling
    print(n);
 
// This code is contributed by aashish1995
 
</script>

Producción : 
 

    0
   101
  21012
 3210123
432101234

Complejidad de tiempo: O (n * n), donde n es el número de filas en el patrón

Espacio Auxiliar : O(1)