题目描述
blablabla
样例
include [HTML_REMOVED]
include [HTML_REMOVED]
include [HTML_REMOVED]
using namespace std;
int main()
{
char str[100][100] = { 0 };
int n;
scanf(“%d”, &n);
int i = 0;
for (i = 0; i <= n; i)
{
int j = 0;
for (j = 0; j < 2 * n - 2 * i; j)
{
str[i][j] = ‘ ‘;
}
for (int k = 0; k <= i; k)
{
str[i][j] = ‘0’ + k;
str[i][j + 1] = ‘ ‘;
j = j + 2;
}
for (int k = i-1; k >= 0; –k)
{
str[i][j] = ‘0’ + k;
str[i][j + 1] = ‘ ‘;
j = j + 2;
}
}
for (i = n + 1; i <= 2 * n + 1; i)
{
int j = 0;
for (j = 0; j < 2 * i - 2 * n; j)
{
str[i][j] = ‘ ‘;
}
for (int k = 0; k <= 2 * n - i; k)
{
str[i][j] = ‘0’ + k;
str[i][j + 1] = ‘ ‘;
j = j + 2;
}
for (int k = 2 * n - i - 1; k >= 0; –k)
{
str[i][j] = ‘0’ + k;
str[i][j + 1] = ‘ ‘;
j = j + 2;
}
}
for (int i = 0; i < 2 * n + 1; ++i)
{
printf(“%s\n”, str[i]);
}
}
作者:sxdt33
链接:https://www.acwing.com/solution/content/224026/
来源:AcWing
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla