Java实现带嵌套小菱形及连续字母的多菱形图形问题求助

Got it, let's tackle your problem. Your current code only adds the letter "A" to every diamond (and only on the bottom row), which doesn't match the requirement of sequential letters from A for each diamond. Plus, the spacing logic was off, which would break alignment when adding letters. Here's how to fix it:

Key Issues in Your Original Code #

• Fixed Letter: You're using letter[0] for all diamonds instead of incrementing the letter based on the diamond's position.
• Misaligned Spacing: The right-side space loop had a messy condition, and there was no consistent spacing between diamonds to fit the letters without overlapping.
• No Input Validation: You didn't check if the height is odd (required for nested diamonds) or if the number of diamonds exceeds the available letters.

Corrected Code #

import java.util.Scanner;

public class ManyDiamond {
    public static void main(String[] args) {
        Scanner scn = new Scanner(System.in);
        System.out.println("请输入高度:");
        int h = scn.nextInt();
        
        // Ensure height is odd (required for nested diamond)
        if (h % 2 == 0) {
            System.out.println("高度请输入奇数，否则无法嵌套菱形！");
            scn.close();
            return;
        }
        
        System.out.print("请输入菱形数量:");
        int nCount = scn.nextInt();
        scn.close();

        char[] letters = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
        
        // Check if we have enough letters for the number of diamonds
        if (nCount > letters.length) {
            System.out.println("菱形数量超过字母表长度，请减少数量！");
            return;
        }

        // Top half of diamonds (including middle row)
        for (int row = 1; row <= h; row++) {
            for (int diamondIdx = 0; diamondIdx < nCount; diamondIdx++) {
                // Left spaces
                for (int k = 1; k <= h - row; k++) {
                    System.out.print(" ");
                }
                // Draw * and O for current row
                int starCount = 2 * row - 1;
                for (int m = 1; m <= starCount; m++) {
                    // Outer diamond borders
                    if (m == 1 || m == starCount) {
                        System.out.print("*");
                    }
                    // Inner O diamond borders (only when row is high enough)
                    else if (row >= 3 && (m == 3 || m == starCount - 2)) {
                        System.out.print("O");
                    } else {
                        System.out.print(" ");
                    }
                }
                // Right spaces
                for (int k = 1; k <= h - row; k++) {
                    System.out.print(" ");
                }
                // Add letter only on the bottom row of the diamond, plus a space for separation
                if (row == h) {
                    System.out.print(letters[diamondIdx] + " ");
                } else {
                    System.out.print(" ");
                }
            }
            System.out.println();
        }

        // Bottom half of diamonds
        int lowerHeight = h - 1;
        for (int row = 1; row <= lowerHeight; row++) {
            for (int diamondIdx = 0; diamondIdx < nCount; diamondIdx++) {
                // Left spaces
                for (int k = 1; k <= row; k++) {
                    System.out.print(" ");
                }
                // Draw * and O for current row
                int starCount = 2 * (h - row) - 1;
                for (int m = 1; m <= starCount; m++) {
                    // Outer diamond borders
                    if (m == 1 || m == starCount) {
                        System.out.print("*");
                    }
                    // Inner O diamond borders (only when row is high enough)
                    else if ((h - row) >= 3 && (m == 3 || m == starCount - 2)) {
                        System.out.print("O");
                    } else {
                        System.out.print(" ");
                    }
                }
                // Right spaces
                for (int k = 1; k <= row; k++) {
                    System.out.print(" ");
                }
                // Add space between diamonds for alignment
                System.out.print(" ");
            }
            System.out.println();
        }
    }
}

What Changed? #

1. Input Validation: Added checks for odd height (since a nested diamond needs an odd height to center properly) and enough letters for the number of diamonds.
2. Sequential Letters: Used diamondIdx (0-based index for each diamond) to pick the correct letter from the array, so the first diamond gets A, second B, etc.
3. Consistent Spacing: Added a space between each diamond to prevent overlap, and only placed the letter on the bottom row of each diamond (so it doesn't break the diamond shape).
4. Cleaned Up Logic: Simplified the right-side space loops and fixed the inner O diamond condition for the bottom half of the diamonds.

Example Output (H=5, N=3) #

*        *        *   
   *O*      *O*      *O*  
  * O *    * O *    * O * 
 *   O *  *   O *  *   O *
    *A       *B       *C   
   *O*      *O*      *O*  
  * O *    * O *    * O * 
 *   O *  *   O *  *   O *
    *        *        *   

This way, each diamond has its sequential letter attached to its bottom row, and the diamond structure stays intact.

内容的提问来源于stack exchange，提问作者Yao Chen