打印有趣图案的程序

程序打印以下图案：

例子 ：

Input : 5
Output: 
* * * * *  * * * * *
* * * *      * * * *
* * *          * * *
* *              * *
*                  *
*                  *
* *              * *
* * *          * * *
* * * *      * * * *
* * * * *  * * * * *

该程序分为四个部分。

C++

// C++ program to print
// the given pattern
#include
using namespace std;
 
void pattern(int n)
{
    int i, j;
     
    // This is upper half of pattern
    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= (2 * n); j++)
        {
             
            // Left part of pattern
            if (i > (n - j + 1))
                cout << " ";
            else
                cout << "*";
                  
            // Right part of pattern
            if ((i + n) > j)
                cout << " ";
            else
                cout << "*";
        }
        cout << endl ;
    }
      
    // This is lower half of pattern
    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= (2 * n); j++)
        {
             
            // Right Part of pattern
            if (i < j)
                cout << " ";
            else
                cout << "*";
              
            // Left Part of pattern
            if (i <= ((2 * n) - j))
                cout << " ";
            else
                cout << "*";
        }
        cout << endl;
    }
}
  
// Driver Code
int main()
{
    pattern(7);
     
    return 0;
}
 
// This code is contributed by bunnyram19

C

// C program to print
// the given pattern
 
#include
void pattern(int n)
{
    int i,j;
 
    // This is upper half of pattern
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=(2*n); j++)
        {
            // Left part of pattern
            if (i>(n-j+1))
                printf(" ");
            else
                printf("*");
                 
            // Right part of pattern
            if ((i+n)>j)
                printf(" ");
            else
                printf("*");
        }
        printf("\n");
    }
     
    // This is lower half of pattern
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=(2*n); j++)
        {
            // Right Part of pattern
            if (i

---

Java

// Java program to print
// the given pattern
import java.io.*;
 
class GFG {
     
    static void pattern(int n)
    {
        int i, j;
 
        // This is upper half of pattern
        for (i = 1; i <= n; i++) {
            for (j = 1; j <= (2 * n); j++) {
                 
                // Left part of pattern
                if (i > (n - j + 1))
                    System.out.print(" ");
                else
                    System.out.print("*");
 
                // Right part of pattern
                if ((i + n) > j)
                    System.out.print(" ");
                else
                    System.out.print("*");
            }
             
            System.out.println("");
        }
 
        // This is lower half of pattern
        for (i = 1; i <= n; i++) {
            for (j = 1; j <= (2 * n); j++) {
                 
                // Right Part of pattern
                if (i < j)
                    System.out.print(" ");
                else
                    System.out.print("*");
 
                // Left Part of pattern
                if (i <= ((2 * n) - j))
                    System.out.print(" ");
                else
                    System.out.print("*");
            }
             
            System.out.println("");
        }
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        pattern(7);
    }
}
 
// This code is contributed by vt_m

Python3

# Python3 program to print
# the given pattern
 
def pattern(n):
     
    # This is upper half of pattern
    for i in range (1, n + 1):
        for j in range (1, 2 * n):
             
            # Left part of pattern
            if i > (n - j + 1):
                print("", end = ' ');
            else:
                print("*", end = '');
                 
            # Right part of pattern
            if i + n - 1 > j:
                print("", end = ' ');
            else:
                print("*", end = '');
        print("");
         
    # This is lower half of pattern
    for i in range (1, n + 1):
        for j in range (1, 2 * n):
            #Left part of pattern
            if i < j:
                print("", end = ' ');
            else:
                print("*", end = '');
                 
            # Right part of pattern
            if i < 2 * n - j:
                print("", end = ' ');
            else:
                print("*", end = '');
        print("");
         
# Driver Code
pattern(7);
 
# This code is contributed by mits

C#

// C# program to print
// the given pattern
using System;
 
class GFG
{
    static void pattern(int n)
    {
        int i, j;
 
        // This is upper
        // half of pattern
        for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= (2 * n); j++)
            {
                 
                // Left part of pattern
                if (i > (n - j + 1))
                    Console.Write(" ");
                else
                    Console.Write("*");
 
                // Right part of pattern
                if ((i + n) > j)
                    Console.Write(" ");
                else
                    Console.Write("*");
            }
             
            Console.WriteLine("");
        }
 
        // This is lower
        // half of pattern
        for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= (2 * n); j++)
            {
                 
                // Right Part of pattern
                if (i < j)
                    Console.Write(" ");
                else
                    Console.Write("*");
 
                // Left Part of pattern
                if (i <= ((2 * n) - j))
                    Console.Write(" ");
                else
                    Console.Write("*");
            }
             
            Console.WriteLine("");
        }
    }
     
    // Driver Code
    static public void Main ()
    {
        pattern(7);
    }
}
 
// This code is contributed by ajit

PHP

 ($n - $j + 1))
                echo " ";
            else
                echo "*";
                 
            // Right part of pattern
            if (($i + $n) > $j)
                echo " ";
            else
                echo "*";
        }
        printf("\n");
    }
     
    // This is lower half of pattern
    for ($i = 1; $i <= $n; $i++)
    {
        for ($j = 1; $j <= (2 * $n); $j++)
        {
            // Right Part of pattern
            if ($i < $j)
                echo " ";
            else
                echo "*";
             
            // Left Part of pattern
            if ($i <= ((2 * $n) - $j))
                echo " ";
            else
                echo "*";
        }
        echo "\n";
    }
}
 
// Driver Code
pattern(7);
 
// This code is contributed by m_kit
?>

Javascript

 
      // JavaScript program to print
      // the given pattern
 
      function pattern(n) {
        var i, j;
 
        // This is upper half of pattern
        for (i = 1; i <= n; i++) {
          for (j = 1; j <= 2 * n; j++) {
            // Left part of pattern
            if (i > n - j + 1)
            document.write("  ");
            else
            document.write("*");
 
            // Right part of pattern
            if (i + n > j)
            document.write("  ");
            else
            document.write("*");
          }
          document.write("<br>");
        }
 
        // This is lower half of pattern
        for (i = 1; i <= n; i++) {
          for (j = 1; j <= 2 * n; j++) {
            // Right Part of pattern
            if (i < j)
            document.write("  ");
            else
            document.write("*");
 
            // Left Part of pattern
            if (i <= 2 * n - j)
            document.write("  ");
            else
            document.write("*");
          }
          document.write("<br>");
        }
      }
 
      // Driver Code
      pattern(7);
       
    

输出 ：

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

程序打印以下图案：

例子 ：

Input : 5
Output: 
*                  *
* *              * *
* * *          * * *
* * * *      * * * *
* * * * *  * * * * *
* * * * *  * * * * *
* * * *      * * * *
* * *          * * *
* *              * *
*                  *

该程序分为四个部分。

C++

// C++ program to print the
// given pattern
#include 
using namespace std;
 
void pattern(int n)
{
    int i, j;
     
    // This is upper half of pattern
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= (2 * n); j++)
        {
            // Left part of pattern
            if (i < j)
                cout << " ";
            else
                cout << "*";
             
            // Right part of pattern
            if (i <= ((2 * n) - j))
                cout << " ";
            else
                cout << "*";
        }
        cout << "\n";
    }
     
    // This is lower half of pattern
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= (2 * n); j++)
        {
            // Left part of pattern
            if (i > (n - j + 1))
                cout <<" ";
            else
                cout <<"*";
                 
            // Right part of pattern
            if ((i + n) > j)
                cout << " ";
            else
                cout << "*";
        }
        cout << "\n";
    }
}
 
// Driver Code
int main()
{
    pattern(7);
    return 0;
}
 
// This code is contributed by shivanisinghss2110

C

// C program to print the
// given pattern
 
#include
void pattern(int n)
{
    int i,j;
     
    // This is upper half of pattern
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=(2*n); j++)
        {
            // Left part of pattern
            if (i(n-j+1))
                printf(" ");
            else
                printf("*");
                 
            // Right part of pattern
            if ((i+n)>j)
                printf(" ");
            else
                printf("*");
        }
        printf("\n");
    }
}
 
// Driver Code
int main()
{
    pattern(7);
    return 0;
}

Java

// Java program to print the
// given pattern
 
import java.io.*;
 
class GFG {
 
    static void pattern(int n)
    {
        int i, j;
 
        // This is upper half of pattern
        for (i = 1; i <= n; i++) {
            for (j = 1; j <= (2 * n); j++) {
                 
                // Left part of pattern
                if (i < j)
                    System.out.print(" ");
                else
                    System.out.print("*");
 
                // Right part of pattern
                if (i <= ((2 * n) - j))
                    System.out.print(" ");
                else
                    System.out.print("*");
            }
             
            System.out.println("");
        }
 
        // This is lower half of pattern
        for (i = 1; i <= n; i++) {
            for (j = 1; j <= (2 * n); j++) {
                 
                // Left part of pattern
                if (i > (n - j + 1))
                    System.out.print(" ");
                else
                    System.out.print("*");
 
                // Right part of pattern
                if ((i + n) > j)
                    System.out.print(" ");
                else
                    System.out.print("*");
            }
             
            System.out.println("");
        }
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        pattern(7);
    }
}
 
// This code is contributed by vt_m

Python3

# Python3 program to
# print the given pattern
 
def pattern(n):
     
    # This is upper
    # half of pattern
    for i in range(1, n + 1):
        for j in range(1, 2 * n + 1):
             
            # Left part of pattern
            if (i < j):
                print("", end = " ");
            else:
                print("*", end = "");
                 
            # Right part of pattern
            if (i <= ((2 * n) - j)):
                print("", end = " ");
            else:
                print("*", end = "");
        print("");
     
    # This is lower
    # half of pattern
    for i in range(1, n + 1):
        for j in range(1, 2 * n + 1):
             
            # Left part of pattern
            if (i > (n - j + 1)):
                print("", end = " ");
            else:
                print("*", end = "");
             
            # Right part of pattern
            if ((i + n) > j):
                print("", end = " ");
            else:
                print("*", end = "");
        print("");
 
# Driver Code
pattern(7);
 
# This code is contributed
# by mits

C＃

// C# program to print
// the given pattern
using System;
 
class GFG
{
    static void pattern(int n)
    {
        int i, j;
 
        // This is upper
        // half of pattern
        for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= (2 * n); j++)
            {
                 
                // Left part of pattern
                if (i < j)
                    Console.Write(" ");
                else
                    Console.Write("*");
 
                // Right part of pattern
                if (i <= ((2 * n) - j))
                    Console.Write(" ");
                else
                    Console.Write("*");
            }
             
            Console.WriteLine("");
        }
 
        // This is lower
        // half of pattern
        for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= (2 * n); j++)
            {
                 
                // Left part of pattern
                if (i > (n - j + 1))
                    Console.Write(" ");
                else
                    Console.Write("*");
 
                // Right part of pattern
                if ((i + n) > j)
                    Console.Write(" ");
                else
                    Console.Write("*");
            }
             
            Console.WriteLine("");
        }
    }
 
    // Driver Code
    static public void Main ()
    {
        pattern(7);
    }
}
 
// This code is contributed by ajit

的PHP

 ($n - $j + 1))
                echo " ";
            else
                echo "*";
                 
            // Right part of pattern
            if (($i + $n) > $j)
                echo " ";
            else
                echo "*";
        }
    echo "\n";
    }
}
 
// Driver Code
pattern(7);
 
// This code is contributed by aj_36
?>

Java脚本

 
// Javascript program to prvar the
// given pattern  
function pattern(n)
{
    var i, j;
     
    // This is upper half of pattern
    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= (2 * n); j++)
        {
             
            // Left part of pattern
            if (i < j)
                document.write("  ");
            else
                document.write("*");
     
            // Right part of pattern
            if (i <= ((2 * n) - j))
                document.write("  ");
            else
                document.write("*");
        }
        document.write('<br>');
    }
     
    // This is lower half of pattern
    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= (2 * n); j++)
        {
             
            // Left part of pattern
            if (i > (n - j + 1))
                document.write("  ");
            else
                document.write("*");
     
            // Right part of pattern
            if ((i + n) > j)
                document.write("  ");
            else
                document.write("*");
        }
        document.write('<br>');
    }
}
 
// Driver Code
pattern(7);
 
// This code is contributed by Princi Singh
 

输出 ：

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

想要从精选的最佳视频中学习和练习问题，请查看《基础知识到高级C的C基础课程》。