题解 | #上下金字塔#

#include<iostream>

using namespace std;

int n;

int main()
{
    while(cin>>n)
    {
        int tmp1=0;
        int t1=n;
        while(t1--)//上层 
        {
            tmp1++;
            for(int i=1;i<=t1;i++)
                cout<<" ";
            for(int i=1;i<2*tmp1;i++)
                cout<<"*";
            cout<<endl;
        }
        int t2=n-1;
        int tmp2=0;
        while(t2--)//下层
        {
            tmp2++;
            for(int i=1;i<=tmp2;i++)
                cout<<" ";
            for(int i=1;i<(t2+1)*2;i++)
                cout<<"*";
            cout<<endl;
        }
    }
    return 0;
}