![]() |
#2
不玩虚的2015-11-21 23:14
int count = 0;//计数 int n = 4;//层数 int position = n;//位置 for (int i = 1; i <= 2*n-1; i++) { int old = position; for (int k = 1; k <= 2*n-1; k++) { if(i<=n){ if (k == position) { if (count > i-1) { cout<<" "; } else { cout<<i; } count++; position = position + 2; } else { cout<<" "; } }else{ if (k == position) { if (count > 2*n-1-i) { cout<<" "; } else { cout<<(2*n-1-i+1); } count++; position = position + 2; } else { cout<<" "; } } } if(i>=n){ position = i-n+2; }else{ position = old - 1; } count = 0; cout<<endl; } //写的很笨,自己优化下吧 |
只有本站会员才能查看附件,请 登录
就是这个形状的,新手求助,有没有帮忙的大神呀