PAT 1031. Hello World for U (20)题解

最新推荐文章于 2022-11-29 08:50:46 发布

HarvestWu

最新推荐文章于 2022-11-29 08:50:46 发布

阅读量165

点赞数

分类专栏： PAT Practice 文章标签： Java

本文链接：https://blog.csdn.net/HarvestWu/article/details/80044526

版权

PAT Practice 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

注意先根据约束条件求出行数n1与列数n2，然后根据相应坐标的规律输出即可。

import java.util.Scanner;

/**
Created by HarvestWu on 2018/4/22.
*/
public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        char[] c = in.next().toCharArray();
        int n1,n2,n3;
        if ((c.length+2)%3==0)
            n1=n2=(c.length+2)/3;
        else {
            n1=(c.length+2)/3;
            n2=(c.length+2)-2*n1;
        }
        for (int i = 0;i<n1-1;i++){
            for (int j = 0;j<n2;j++){
                if (j==0)
                    System.out.print(c[i]);
                else if (j==n2-1)
                    System.out.print(c[c.length-1-i]);
                else System.out.print(" ");
            }
            System.out.println();
        }
        for (int i=n1-1;i<n1+n2-1;i++){
            System.out.print(c[i]);
        }
    }
}