1

如何制作线条为 1、3、5、3、5、7、5、7、9、7、9 的圣诞树？

圣诞树应该是这样的：

               x
              xxx
             xxxxx
              xxx
             xxxxx
            xxxxxxx
             xxxxx
            xxxxxxx
           xxxxxxxxx
            xxxxxxx
           xxxxxxxxx
          xxxxxxxxxxx

它要求用户输入行数。到目前为止，我已经得到了这个。早些时候做了一个金字塔*

import java.util.Scanner;

public class Pyramide {

    public static void main(String[] args) {

        // les inn antall rader
        System.out.println("Hvor mange rader skal pyramiden ha?");

        int antallRader;
        Scanner tastatur = new Scanner(System.in);
        antallRader = tastatur.nextInt();

        // skrive ut en kolonne som har saa mange rader som det ble angitt
        // for hver verdi som rad kan faa naar rad starter paa 1, er mindre
        // eller lik antallRader, og oekes hver gang med 1)

        // for hver verdi mellom startverdien og sluttverdien med avstand 1
        // gjenta
        for (int rad = 1; rad <= antallRader; rad++) {
            for (int antallTomt = 1; antallTomt <= antallRader - rad; antallTomt++) {
                System.out.print(" ");
            }
            for (int antallX = 1; antallX <= 2 * rad - 1; antallX++) {
                System.out.print("x");
            }
            for (int antallX = 1; antallX <= 2 * rad - 1; antallX++) {
                System.out.print("x");
            }
            System.out.println();
        }

    }

}

我认为它是一个以某种方式变为 +2、+2、-2 的循环。但我不知道如何编程。

4

3 回答 3

4

你非常接近。请考虑：

int linjer = 0;
int radDenneGang = 1;
while (linjer < antallRader) {
    int antallRaderDenneGang;
    if (antallRader - linjer >= 3)
        antallRaderDenneGang = radDenneGang + 2;
    else
        antallRaderDenneGang = radDenneGang + antallRader - linjer - 1;
    for (int rad = radDenneGang; rad <= antallRaderDenneGang; rad++) {
        for (int antallTomt = 1; antallTomt <= antallRader - rad; antallTomt++) {
            System.out.print(" ");
        }
        for (int antallX = 1; antallX <= 2 * rad - 1; antallX++) {
            System.out.print("x");
        }
        // for (int antallX = 1; antallX <= 2 * rad - 1; antallX++) {
        // System.out.print("x");
        // }
        System.out.println();
    }
    linjer += antallRaderDenneGang - radDenneGang + 1;
    radDenneGang++;
}

使用antallRader=15，它会生成以下美丽的圣诞树：

          x
         xxx
        xxxxx
         xxx
        xxxxx
       xxxxxxx
        xxxxx
       xxxxxxx
      xxxxxxxxx
       xxxxxxx
      xxxxxxxxx
     xxxxxxxxxxx
      xxxxxxxxx
     xxxxxxxxxxx
    xxxxxxxxxxxxx
于 2013-08-30T01:22:01.377 回答
1

第一步可能是抽象的东西。我的意思是，制作一个只打印这棵树的一行的方法：

private static void branch(int width,int centerPoint) {
    for (int i = 0; i < centerPoint - width / 2; i++) {
        System.out.print(' ');
    }
    for (int i = 0; i < width; i++) {
        System.out.print('x');
    }
}

然后你可以制作任何你喜欢的形状的树：

public static void main(String... args) {
    System.out.println("Hvor mange rader skal pyramiden ha?");
    Scanner scanner = new Scanner(System.in);
    int numRows = scanner.nextInt();
    int width = 1;
    for (int i = 0;i < numRows;i++) {
        branch(width,numRows / 3 + 2);
        if (width % 3 == 2)
            width -= 2; //Reduces the width by 2 if it's line 2, 5, 8, etc.
        else
            width += 2; //Other lines, increases the width by 2.
    }
}
于 2013-08-30T01:14:16.140 回答
0

干得好 ！

String x = "                xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx";
int ix = x.indexOf('x');
for (int i = 0; i < 12; i++) {
    int j = i/3 + i%3;
    System.out.println(x.substring(j, ix + 2*j + 1));
}

输出

            x
           xxx
          xxxxx
           xxx
          xxxxx
         xxxxxxx
          xxxxx
         xxxxxxx
        xxxxxxxxx
         xxxxxxx
        xxxxxxxxx
       xxxxxxxxxxx
于 2013-08-30T02:18:17.283 回答