just for fun, bit 99.9%


  • 0

    just for fun!

    public int countArrangement(int N) {
        int[] res = {1, 2, 3, 8, 10, 36, 41, 132, 250, 700, 750, 4010, 4237, 10680, 24679};
        return res[N-1];
    }
    

    hahaha


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.