Hello World for U 【浙江大学复试机试题】

最新推荐文章于 2022-08-12 12:15:18 发布

原创最新推荐文章于 2022-08-12 12:15:18 发布 · 473 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

考研机试题专栏收录该内容

57 篇文章

订阅专栏

本文介绍了一种将任意长度的字符串转换为U形排列的算法。通过确定左列、底部行和右列的长度，使得U形尽可能接近正方形，并保持字符的原始顺序。文章提供了详细的实现思路和C++代码示例。

题目描述

Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as: h d e l l r lowo That is, the characters must be printed in the original order, starting top-down from the left vertical line with n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 2 = N.

输入描述:

There are multiple test cases.Each case contains one string with no less than 5 and no more than 80 characters in a line. The string contains no white space.

输出描述:

For each test case, print the input string in the shape of U as specified in the description.

示例1

输入

复制

helloworld!
www.nowcoder.com

输出

复制

h   !
e   d
l   l
lowor
w    m
w    o
w    c
.    .
n    r
owcode

读懂题目是关键,

n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N }

n1 + n2 + n3 - 2 = N.

题目中的信息简化一下就是

n1:左边列的长度

n2:下方行的长度

n3:右边列的长度

n1=n3<=n2(n2满足3 <= n2 <= N ，且是其可取的最大值）

n1 + n2 + n3 - 2 = N.

在下边这个例子中，n1=4,n2=5,n3=4;

思路：

先找出满足条件的n1、n2、n3,再赋值到数组中，赋值完成后输出

#include<iostream>
#include<cstring>
#include<algorithm> 
using namespace std;

int main() {
	int n1,n2,n3;
	int i,j;
	char str[100],res[100][100];
	while(scanf("%s",&str)!=EOF) {
		for(i=0; i<100; i++) {
			for(j=0; j<100; j++) {
				res[i][j]=' ';
			}
		}
		int slen=strlen(str);
		n1=n3=1;
		n2=slen+2-n1-n3;
		while(n1<=n2) {
			n1++;
			n2=slen+2-2*n1;
		}
		n1--;
		n3=n1;
		n2=slen+2-2*n1;
		int count=0;
		//第一列
		for(i=0; i<n1; i++) {
			res[i][0]=str[count++];
		}
		//行
		count--;
		i--;
		for(j=0; j<n2; j++) {
			res[i][j]=str[count++];
		}
		//右边列
		count--;
		j--;
		for(i=n1-1; i>=0; i--) {
			res[i][j]=str[count++];
		}
		for(i=0; i<n1; i++) {
			for(j=0; j<n2+1; j++) {
				printf("%c",res[i][j]);
			}
			printf("\n");
		}


	}
	return 0;
}