📜  程序打印钻石形状

📅  最后修改于: 2021-05-30 15:05:00             🧑  作者: Mango

给定数字n,编写一个程序来打印2n行的菱形形状。
例子 :

钻石

C++
// C++ program to print diamond shape
// with 2n rows
#include 
using namespace std;
 
// Prints diamond pattern with 2n rows
void printDiamond(int n)
{
    int space = n - 1;
 
    // run loop (parent loop)
    // till number of rows
    for (int i = 0; i < n; i++)
    {
        // loop for initially space,
        // before star printing
        for (int j = 0;j < space; j++)
            cout << " ";
 
        // Print i+1 stars
        for (int j = 0; j <= i; j++)
            cout << "* ";
 
        cout << endl;
        space--;
    }
 
    // Repeat again in reverse order
    space = 0;
 
    // run loop (parent loop)
    // till number of rows
    for (int i = n; i > 0; i--)
    {
        // loop for initially space,
        // before star printing
        for (int j = 0; j < space; j++)
            cout << " ";
 
        // Print i stars
        for (int j = 0;j < i;j++)
            cout << "* ";
 
        cout << endl;
        space++;
    }
}
 
// Driver code
int main()
{
    printDiamond(5);
    return 0;
}
 
// This is code is contributed
// by rathbhupendra


C
// C program to print
// diamond shape with
// 2n rows
#include
 
// Prints diamond
// pattern with 2n rows
void printDiamond(int n)
{
    int space = n - 1;
 
    // run loop (parent loop)
    // till number of rows
    for (int i = 0; i < n; i++)
    {
        // loop for initially space,
        // before star printing
        for (int j = 0;j < space; j++)
            printf(" ");
 
        // Print i+1 stars
        for (int j = 0;j <= i; j++)
            printf("* ");
 
        printf("\n");
        space--;
    }
 
    // Repeat again in
    // reverse order
    space = 0;
 
    // run loop (parent loop)
    // till number of rows
    for (int i = n; i > 0; i--)
    {
        // loop for initially space,
        // before star printing
        for (int j = 0; j < space; j++)
            printf(" ");
 
        // Print i stars
        for (int j = 0;j < i;j++)
            printf("* ");
 
        printf("\n");
        space++;
    }
}
 
// Driver code
int main()
{
    printDiamond(5);
    return 0;
}


Java
// JAVA Code to print
// the diamond shape
import java.util.*;
 
class GFG
{
     
    // Prints diamond pattern
    // with 2n rows
    static void printDiamond(int n)
    {
        int space = n - 1;
     
        // run loop (parent loop)
        // till number of rows
        for (int i = 0; i < n; i++)
        {
            // loop for initially space,
            // before star printing
            for (int j = 0; j < space; j++)
                System.out.print(" ");
     
            // Print i+1 stars
            for (int j = 0; j <= i; j++)
                System.out.print("* ");
     
            System.out.print("\n");
            space--;
        }
     
        // Repeat again in
        // reverse order
        space = 0;
     
        // run loop (parent loop)
        // till number of rows
        for (int i = n; i > 0; i--)
        {
            // loop for initially space,
            // before star printing
            for (int j = 0; j < space; j++)
                System.out.print(" ");
     
            // Print i stars
            for (int j = 0; j < i; j++)
                System.out.print("* ");
     
            System.out.print("\n");
            space++;
        }
    }
     
    // Driver Code
    public static void main(String[] args)
    {
        printDiamond(5);
         
    }
}
 
// This code is contributed
// by Arnav Kr. Mandal.


Python3
# Python program to
# print Diamond shape
 
# Function to print
# Diamond shape
def Diamond(rows):
    n = 0
    for i in range(1, rows + 1):
        # loop to print spaces
        for j in range (1, (rows - i) + 1):
            print(end = " ")
         
        # loop to print star
        while n != (2 * i - 1):
            print("*", end = "")
            n = n + 1
        n = 0
         
        # line break
        print()
 
    k = 1
    n = 1
    for i in range(1, rows):
        # loop to print spaces
        for j in range (1, k + 1):
            print(end = " ")
        k = k + 1
         
        # loop to print star
        while n <= (2 * (rows - i) - 1):
            print("*", end = "")
            n = n + 1
        n = 1
        print()
 
# Driver Code
# number of rows input
rows = 5
Diamond(rows)


C#
// C# Code to print
// the diamond shape
using System;
 
class GFG
{
     
    // Prints diamond pattern
    // with 2n rows
    static void printDiamond(int n)
    {
        int space = n - 1;
     
        // run loop (parent loop)
        // till number of rows
        for (int i = 0; i < n; i++)
        {
            // loop for initially space,
            // before star printing
            for (int j = 0; j < space; j++)
                Console.Write(" ");
     
            // Print i+1 stars
            for (int j = 0; j <= i; j++)
                Console.Write("* ");
     
            Console.Write("\n");
            space--;
        }
     
        // Repeat again in
        // reverse order
        space = 0;
     
        // run loop (parent loop)
        // till number of rows
        for (int i = n; i > 0; i--)
        {
            // loop for initially space,
            // before star printing
            for (int j = 0; j < space; j++)
                Console.Write(" ");
     
            // Print i stars
            for (int j = 0; j < i; j++)
                Console.Write("* ");
     
            Console.Write("\n");
            space++;
        }
    }
     
    // Driver Code
    public static void Main()
    {
        printDiamond(5);
         
    }
}
 
// This code is contributed
// by Smitha Semwal.


PHP
 0; $i--)
    {
         
        // loop for initially space,
        // before star printing
        for ($j = 0; $j < $space; $j++)
            printf(" ");
 
        // Pr$i stars
        for ($j = 0;$j < $i;$j++)
            printf("* ");
 
        printf("\n");
        $space++;
    }
}
 
    // Driver code
    printDiamond(5);
 
// This code is contributed by Anuj_67
?>


Javascript


输出 :

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