题目:
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.
Input Specification:
Each input file contains one test case. 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.
Output Specification:
For each test case, print the input string in the shape of U as specified in the description.
Sample Input:
helloworld!
Sample Output:
h !
e d
l l
lowor
思路:1.先二分找出n1和n2,再得出n3。
2.n1即是行数,n3即是列数,根据题目格式输出
代码:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
int n = s.length() + 2;
//二分找到最大符合k<=n2的数
int l = 0, r = n;
while (l < r) {
int mid = (l + r + 1) / 2;
if (mid <= (n - 2 * mid)) l = mid;
else r = mid - 1;
}
int n2 = n - 2 * r;
//有n3列
String space = "";
for (int i = 0; i < n2 - 2; i++) {
space += " ";
}
//有r行
int start = 0, end = s.length() - 1;
for (int i = 0; i < r; i++) {
if (i == r - 1) { //如果是最后一行
System.out.println(s.charAt(start) + s.substring(start + 1, end) + s.charAt(end));
} else {
System.out.println(s.charAt(start++) + space + s.charAt(end--));
}
}
}
}