解决Java程序中商品目录选择顺序错误导致的数组越界问题

import java.util.Scanner;
import java.util.HashMap;

public class CatalogSelection {

    public static void main(String[] args) {
        String[] name = {"Product A", "Product B", "Product C"}; // 商品名称数组
        HashMap<String, Double> quantityMap = new HashMap<>(); // 使用HashMap存储商品数量
        Scanner myObj = new Scanner(System.in);
        int ItemNumber;
        double ItemQuantity;
        String ItemName;

        do {
            System.out.println("Select the number of the product you would like and once you are finished enter the number to checkout.\n");
            for (int i = 0; i < name.length; i++) {
                System.out.println((i + 1) + ". " + name[i]);
            }
            System.out.println((name.length + 1) + ". Checkout");

            ItemNumber = myObj.nextInt();

            if (ItemNumber >= 1 && ItemNumber <= name.length) {
                System.out.println("How many would you like?\n");
                ItemQuantity = myObj.nextDouble();
                ItemName = name[ItemNumber - 1];

                // 更新HashMap中的商品数量
                if (quantityMap.containsKey(ItemName)) {
                    quantityMap.put(ItemName, quantityMap.get(ItemName) + ItemQuantity);
                } else {
                    quantityMap.put(ItemName, ItemQuantity);
                }

                System.out.println("\nThe customer picks " + Math.round(quantityMap.get(ItemName)) + " " + ItemName + "(s)\n");
            } else if (ItemNumber == name.length + 1) {
                System.out.println("Checkout");
                break;
            } else {
                System.out.println("Invalid item number. Please try again.");
            }
        } while (true);

        myObj.close();
    }
}