DHU OJ 循环结构 空心三角形

思路及代码

//input T int 0< <30
//input T 组 ch char n int 0< <41
#include<iostream>
using namespace std;
int main(){
    int T;
    cin >> T;
    while (--T >= 0){
        char ch;
        int n;
        cin >> ch >> n;
//solution
/*
   g        1  3' ' g           
  g g       2  2' ' g   1' ' g  
 g   g      3  1' ' g   3' ' g  
ggggggg     4  7g
n=4         n  n-r      2r-3    
*/
//r from 1->n-1
        for (int r = 1; r <= n-1; r++){
        //' ' from
            for (int i = 1; i <= n-r; i++){
                cout << ' ';
            }
        //ch
            cout << ch;
        
            if (r != 1){
            //' ' from
                for (int i = 1; i <= 2*r-3; i++){
                    cout << ' ';
                }
            //ch
                cout << ch;
            }
        cout << endl;
        }
//r = n
        for (int i = 1; i <= 2*n-1; i++){
            cout << ch;
        }
        cout << endl;
        cout << endl;
    }
    return 0;
}

参考：无

收获：无