以菱形格式打印单词

时间:2017-02-07 02:44:04

标签: java shapes

我的任务是打印一个钻石形状的单词,如下所示:

*****s
****p*p
***i***i
**d*****d
*e*******e    
r*********r
*e*******e
**d*****d
***i***i
****p*p
*****s

P.S。星号只显示间距,假装一个星号代表一个空格。

到目前为止,我有这个:

public class DiamondWords
{
     public static void main(String[] args)
     {
         Scanner kbReader = new Scanner(System.in);
         System.out.print("Enter a word to be printed in diamond format: ");
         String word = kbReader.nextLine();
         int wordLength = word.length();
         for(int i = 0; i<wordLength-1; i++)
         {
             System.out.print(" ");
         }
         wordLength = wordLength - 1;
         System.out.print(word.charAt(0));
         System.out.println();
         int x =1;
         int d =1;

             for(int j =wordLength; j>0; j--)
             {  
                 wordLength = j;
                 for(int a =1; a<wordLength; a++)
                 {
                     System.out.print(" ");
                 }
                 System.out.print(word.charAt(x));
                 for(int q =0; q<d; q++)
                 {
                     System.out.print(" ");
                 }
                 d+=2;
                 System.out.print(word.charAt(x));
                 x++;
                 System.out.println();
             }
            //r*********r
            //*e*******e
            //**d*****d
            //***i***i
            //****p*p
            //*****s
         }
     }

完美打印钻石的前半部分:

    *****s
    ****p*p
    ***i***i
    **d*****d
    *e*******e    
    r*********r

我遇到困难的唯一部分是我必须打印后半部分的钻石。谁能指出我正确的方向?请不要为我编写代码,只是尝试根据我所显示的逻辑给出一些指示。谢谢。

2 个答案:

答案 0 :(得分:0)

尝试只有一个循环。一种非常简单的方法来处理&#34;技术问题&#34;问题是使用char数组输出。首先用适当的长度初始化它,用空白填充它(有一个库函数),填充两个字符,然后才将它转换为字符串。

唯一悬而未决的问题是在哪里放置角色,而我并不想(而且应该)破坏角色。

int fullLength = 2 * word.length() - 1;
for(int i = 0; i < fullLength; i++) {
    char[] line = new char[fullLength];
    Arrays.fill(line, ' ');
    int k = ???;
    char c = s.charAt(k);
    line[word.length() - 1 - k] = c;
    line[word.length() - 1 + k] = c;
    System.out.println(new String(line));
}

显然,你想从中间&#34;计算位置&#34; (所以我们有word.length() - 1 +- k),对于单词的前半部分,k等于i

你的任务,如果你决定接受它,就是找出如何弯曲k&#34;这个词的后半部分。

答案 1 :(得分:0)

import java.util.Scanner;
public class DiamondWords
{
    public static void main(String[] args)
    {
        Scanner kbReader = new Scanner(System.in);
        System.out.print("Enter a word to be printed in diamond format: ");
        String word = kbReader.nextLine();
        int wordLength = word.length();
        int wordLength2 = word.length();
        int wordSize = word.length();
        int wordLengthReverse = word.length();

        for(int i = 0; i<wordLength-1; i++)
        {
            System.out.print(" ");
        }

        wordLength = wordLength - 1;
        System.out.print(word.charAt(0));
        System.out.println();
        int x =1;
        int d =1;

        for(int j =wordLength; j>0; j--)
        {   
            wordLength = j;
            for(int a =1; a<wordLength; a++)
            {
                System.out.print(" ");
            }
            System.out.print(word.charAt(x));
            for(int q =0; q<d; q++)
            {
                System.out.print(" ");
            }
            d+=2;
            System.out.print(word.charAt(x));
            x++;
            System.out.println();
        }

        System.out.print(" " + word.charAt(wordLength2-2));
        int spaceLength =((wordLength2*2)-1) -4;
        int u =spaceLength -2;
        for(int i =0; i < spaceLength; i++)
        {
            System.out.print(" ");
        }
        System.out.print(word.charAt(wordLength2-2));
        System.out.println();

        int m=3;
        for(int num =2; num<wordSize-1; num++)
        {
            wordLength2 = num;
            for(int i =0; i<num; i++)
            {
                System.out.print(" ");
            }
            System.out.print(word.charAt(wordSize-m));
            for(int b = 0; b<u; b++)
            {
                System.out.print(" ");
            }

            System.out.print(word.charAt(wordSize-m));
            System.out.println();
            m++;
            u = u-2;
        }
        for(int r =0; r<word.length()-1; r++)
        {
            System.out.print(" ");
        }
        System.out.print(word.charAt(0));
    }
}

我已经完成了。这是我的最终代码。我知道它不是那么有效,也不容易理解,但它很灵活而且没有硬编码,所以我很满意。