递归之输出菱形

#include<stdio.h>
void print( int m,int n )
{
    for( int i=1;i<=n-m;i++ )
      printf( " " );
    for( int i=1;i<=m*2-1;i++ )
      printf( "*" );
    puts("");
    if( m==n )   return ;
    else
    {
       print( m+1,n );
       for( int i=1;i<=n-m;i++ )
           printf( " " );
       for( int i=1;i<=m*2-1;i++ )
          printf( "*" );
       puts("");    
    }    
}
int main()
{
    int n;
    while( scanf( "%d",&n )!=EOF )
    {
       print( 1,n );      
    }
    return 0;
}

转载于:https://www.cnblogs.com/zsj576637357/archive/2011/11/16/2250541.html