本文概述
- C
- Java
- Python3
- C#
- PHP
- C
- Java
- Python3
- C#
- PHP
例子 ：
Input : 5
Output:
* * * * ** * * * *
* * * ** * * *
* * ** * *
* ** *
**
**
* ** *
* * ** * *
* * * ** * * *
* * * * ** * * * *该程序分为四个部分。
C
//C program to print
//the given pattern#include<
stdio.h>
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<
j)
printf ( " " );
else
printf ( "*" );
//Left Part of pattern
if (i<
=((2*n)-j))
printf ( " " );
else
printf ( "*" );
}
printf ( "\n" );
}
}//main function
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( "" );
}
}//main function
public static void main(String[] args)
{
pattern( 7 );
}
}//This code is contributed by vt_mPython3
# Python3 program to print
# the given patterndef 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 mitsC#
//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 ajitPHP
<
?php
//PHP program to print
//the given patternfunction 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( "\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
?>
输出：
* * * * * * ** * * * * * *
* * * * * ** * * * * *
* * * * ** * * * *
* * * ** * * *
* * ** * *
* ** *
**
**
* ** *
* * ** * *
* * * ** * * *
* * * * ** * * * *
* * * * * ** * * * * *
* * * * * * ** * * * * * *程序打印以下图案：
例子 ：
Input : 5
Output:
**
* ** *
* * ** * *
* * * ** * * *
* * * * ** * * * *
* * * * ** * * * *
* * * ** * * *
* * ** * *
* ** *
**该程序分为四个部分。
C
//C program to print the
//given pattern#include<
stdio.h>
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 ( "\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))
printf ( " " );
else
printf ( "*" );
//Right part of pattern
if ((i+n)>
j)
printf ( " " );
else
printf ( "*" );
}
printf ( "\n" );
}
}//main function
int main()
{
pattern(7);
return 0;
}Java
//Java program to print the
//given patternimport 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( "" );
}
}//main function
public static void main(String[] args)
{
pattern( 7 );
}
}//This code is contributed by vt_mPython3
# Python3 program to
# print the given patterndef 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 mitsC#
//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 ajitPHP
<
?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 "\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))
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
?>
输出：
**
* ** *
* * ** * *
* * * ** * * *
* * * * ** * * * *
* * * * * ** * * * * *
* * * * * * ** * * * * * *
* * * * * * ** * * * * * *
* * * * * ** * * * * *
* * * * ** * * * *
* * * ** * * *
* * ** * *
* ** *
**如果发现任何不正确的地方, 或者想分享有关上述主题的更多信息, 请写评论。
推荐阅读
- 计算机体系结构和计算机组织之间的差异
- 使用就地排序算法对对象进行排序
- 密码学中的生日攻击详细介绍
- 亚马逊面试-SDE 1面试体验
- 使用递归从中间顺序到左右顺序遍历链表
- Teradata面试经验|S1（开发者资料校园）
- 检查是否可以通过修改至少一个元素来使数组严格增加
- 算法题（使用递归反转双向链表）
- 拆分二进制数以使每个部分都可被2整除的方式数量