题目链接
题意:
给定一个字符串按U输出,n1是左侧字符数,n3是右侧字符数,n2是底部字符数,三者有重叠;三者满足n1=n3=k<=n2;n1+n2+n3=N+2;
利用找规律得出他们之间内在的联系;
n1=n3=(N+2)/3,n2=N-n1-n3+2得到;
可以利用先把字符放入二维数组做;也可以直接输出做;
直接输出:
#pragma warning(disable:4996);
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
using namespace std;
int main() {
string str;
cin >> str;
int n = str.size();
int n1 = (n + 2) / 3, n3 = n1, n2 = n + 2 - n1 - n3;//计算公式
for (int i = 0;i < n1 - 1;i++) {//输出前n-1行
printf("%c", str[i]);//先输出左边的字符
for (int j = 0;j < n2 - 2;j++) {//输出对应n2-2个空格
printf(" ");
}
printf("%c\n",str[n - i - 1]);//输出对应的右边字符;
}
for(int i=0;i<n2;i++)
{
printf("%c", str[n1 + i - 1]);//输出底部字符;
}
return 0;
}
写入数组输出数组:
#pragma warning(disable:4996);
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
using namespace std;
int main() {
string str;
cin >> str;
int n = str.size();
int n1 = (n + 2) / 3, n3 = n1, n2 = n + 2 - n1 - n3;//计算公式
char ans[40][40];
for (int i = 1;i <= n1;i++) {
for (int j = 1;j <= n2;j++)
{
ans[i][j] = ' ';//先给二维数组赋初值,后面根据实际情况,进行替换得到正确结果;
}
}
int pos = 0;
for (int i = 1;i <= n1;i++)
{
ans[i][1] = str[pos++];//从上往下赋左侧n1个字符;
}
for (int j = 2;j <= n2;j++)ans[n1][j] = str[pos++];//从左往右赋n2-1个字符,去掉最左因为已经输入过;
for (int j = n3 - 1;j >= 1;j--) ans[j][n2] = str[pos++];
for (int i = 1;i <= n1;i++)
{
for (int j = 1;j <= n2;j++)
printf("%c", ans[i][j]);
printf("\n");
}
return 0;
}