随机生成算法无法正确生成

Question

I have this code to spawn a 'tree' in my Java game; it works and spawns a 'tree'. I decided to make a random number generator up to 30 which would spawn that many 'trees'. However, when I run my code, I get no error but the 'trees' don't spawn. The spawning algorithm can be found below.

private void generateLevel() {
    int dungeonCoord = dungeonSpawn.nextInt(height * width);
    for (int y = 0; y < height; y++) {
        for (int x = 0; x < width; x++) {
            tiles[x + y * width] = Tile.GRASS.getId();
            tiles[dungeonCoord] = Tile.TUNNEL.getId();
             while(tCount < tRan)   {
                 System.out.println(tRan);
                 tCount ++;
                 int treeX = treeSpawn.nextInt(width * 5);
                 if(treeX < 256)    {
                     treeX = 256;
                }else   {
                    tiles[treeX] = Tile.LOG.getId();
                    tiles[treeX + width] = Tile.LOG.getId();
                    tiles[treeX + width + width] = Tile.LOG.getId();
                    tiles[treeX - width] = Tile.LEAVES.getId();
                    tiles[treeX - width] = Tile.LEAVES.getId();
                    tiles[treeX - width - width] = Tile.LEAVES.getId();
                    tiles[treeX - width - width + 1] = Tile.LEAVES.getId();
                    tiles[treeX - width - width - 1] = Tile.LEAVES.getId();
                    tiles[treeX - width + 1] = Tile.LEAVES.getId();
                    tiles[treeX - width + 2] = Tile.LEAVES.getId();
                    tiles[treeX - width - 1] = Tile.LEAVES.getId();
                    tiles[treeX - width - 2] = Tile.LEAVES.getId();
                    tiles[treeX + 1] = Tile.LEAVES.getId();
                    tiles[treeX - 1] = Tile.LEAVES.getId();
                    tiles[treeX - width - width - width] = Tile.LEAVES.getId(); 
                }
            }
        }
    }
}

How everything is declared:

private byte[] tiles;
public int width;
public int height;
public boolean generateTree = true;
Random treeSpawn = new Random();
Random dungeonSpawn = new Random();
Random numTrees = new Random();
int tCount = 0;
int tRan = numTrees.nextInt(30);

The treeSpawn boolean is for later on.

Answer 1

This answer comes from what I can ascertain in the comments.

The code, as follows:

if(treeX < 256)    {
    treeX = 256;
} else   {

means that, if treeX is less than 256, your code doesn't even attempt to draw the tree. In order to draw the tree, you need to remove the else (which is ignored when your if statement is evaluated to be true ) so your while loop looks as follows:

while(tCount < tRan)   {
    System.out.println(tRan);
    tCount ++;
    int treeX = treeSpawn.nextInt(width * 5);

    if(treeX < 256)    {
        treeX = 256;
    }

    tiles[treeX] = Tile.LOG.getId();
    tiles[treeX + width] = Tile.LOG.getId();
    tiles[treeX + width + width] = Tile.LOG.getId();
    tiles[treeX - width] = Tile.LEAVES.getId();
    ... // Rest of the tree drawing code
}