用于打印以下图案的程序：
null
例如：
Input : 5Output: * * * * * * * * * ** * * * * * * ** * * * * ** * * ** ** ** * * ** * * * * ** * * * * * * ** * * * * * * * * *
本课程分为四个部分。
C++
// C++ program to print // the given pattern #include<iostream> 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<stdio.h> 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 ( "" ); } // 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) printf ( " " ); else printf ( "*" ); // Left Part of pattern if (i<=((2*n)-j)) printf ( " " ); else printf ( "*" ); } printf ( "" ); } } // 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 > (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
<?php // PHP program to print // the given pattern function pattern( $n ) { $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)) echo " " ; else echo "*" ; // Right part of pattern if (( $i + $n ) > $j ) echo " " ; else echo "*" ; } printf( "" ); } // 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 "" ; } } // Driver Code pattern(7); // This code is contributed by m_kit ?> |
Javascript
<script> // 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); </script> |
输出：
* * * * * * * * * * * * * ** * * * * * * * * * * ** * * * * * * * * ** * * * * * * ** * * * * ** * * ** ** ** * * ** * * * * ** * * * * * * ** * * * * * * * * ** * * * * * * * * * * ** * * * * * * * * * * * * *
用于打印以下图案的程序：
例如：
Input : 5Output: * ** * * ** * * * * ** * * * * * * ** * * * * * * * * ** * * * * * * * * ** * * * * * * ** * * * * ** * * ** *
本课程分为四个部分。
C++
// C++ program to print the // given pattern #include <bits/stdc++.h> 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 << "" ; } // 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 << "" ; } } // Driver Code int main() { pattern(7); return 0; } // This code is contributed by shivanisinghss2110 |
C
// C program to print the // given pattern #include<stdio.h> 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) printf ( " " ); else printf ( "*" ); // Right part of pattern if (i<=((2*n)-j)) printf ( " " ); else printf ( "*" ); } printf ( "" ); } // 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)) printf ( " " ); else printf ( "*" ); // Right part of pattern if ((i+n)>j) printf ( " " ); else printf ( "*" ); } printf ( "" ); } } // 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
<?php // PHP program to print // the given pattern function pattern( $n ) { $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 ) echo " " ; else echo "*" ; // Right part of pattern if ( $i <= ((2 * $n ) - $j )) echo " " ; else echo "*" ; } echo "" ; } // 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)) echo " " ; else echo "*" ; // Right part of pattern if (( $i + $n ) > $j ) echo " " ; else echo "*" ; } echo "" ; } } // Driver Code pattern(7); // This code is contributed by aj_36 ?> |
Javascript
<script> // 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 < 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 </script> |
输出：
* ** * * ** * * * * ** * * * * * * ** * * * * * * * * ** * * * * * * * * * * ** * * * * * * * * * * * * ** * * * * * * * * * * * * ** * * * * * * * * * * ** * * * * * * * * ** * * * * * * ** * * * * ** * * ** *
本文由 阿迪蒂亚·库马尔 .如果你喜欢GeekSforgek，并想贡献自己的力量，你也可以使用 写极客。组织 或者把你的文章寄去评论-team@geeksforgeeks.org.看到你的文章出现在Geeksforgeks主页上，并帮助其他极客。 如果您发现任何不正确的地方，或者您想分享有关上述主题的更多信息，请写下评论。
© 版权声明
文章版权归作者所有，未经允许请勿转载。
THE END
![关于”PostgreSQL错误：关系[表]不存在“问题的原因和解决方案-yiteyi-C++库](https://www.yiteyi.com/wp-content/themes/zibll/img/thumbnail.svg)
