题解 | #上下金字塔#

同金字塔，分为两部分即可；

最后一部分空格输出可不考虑

#include <bits/stdc++.h>
using namespace std;

void Print(int Max_num,int tmp){
    for(int j = 1;j <= tmp;j++) cout<<" ";
    for(int j = tmp+1;j <= (Max_num-tmp);j++) cout<<"*";
    //for(int j = (Max_num-tmp)+1;j <= Max_num;j++) cout<<" ";
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int n;
    while(cin>>n){
        int Max_num = 2*n - 1;
        for(int i = 1;i <= n;i++){
            int sum = 2*i - 1;    //该层*总个数
            int tmp = (Max_num - sum)/2;
            Print(Max_num,tmp);
            cout<<'\n';
        }
        int k = 1;
        for(int i = n+1;i <= 2*n - 1;i++){
            int sum = 2*(n-(k++))-1;
            int tmp = (Max_num - sum)/2;
            Print(Max_num, tmp);
            cout<<'\n';
        }
    }
    return 0;
}