豆机/梅花瓶 java

import java.util.*;

public class Slots6_21 {
    final static int DEPTH = 10;

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        System.out.print("Enter the number of beans: ");
        int beans = input.nextInt();
        
        simulate(beans);
        
    }


    public static void simulate(int n) {

//最后一层的结果数组，slots[i]表示i+1位置豆子个数
        
        int[] slots = new int[DEPTH+1];     
        
        for(int i = 0; i < n; i++) {
            int col = slots();
            slots[col] ++;
        }

        for(int i = 0; i < slots.length; i++) {
            System.out.println(slots[i]);
        }
    }

//计算每一层的结果
    public static int slots() {
        int[] layer = new int[DEPTH+1];
        layer[0] = 0;
        for(int j = 0; j < layer.length - 1; j++) {
            if((int)(Math.random() * 2) == 0) {                    
                layer[j+1] = layer[j];
            } else {
                layer[j+1] = layer[j] + 1;
            }
        }
        return layer[layer.length-1];
    }
}