1834. 分组选项(复杂)

class Solution:
    """
    @param n: the number of people
    @param m: the number of groups
    @return: the number of grouping options
    """
    ‘‘‘
    大致思路:
    1.首先先判断，将可以直接得的直接返回
    2.f[i][j] = f[i][j] + f[i - j][1] + f[i - j][2] + ... + f[i - j][m] 转移方程
    ‘‘‘
    def groupingOptions(self, n, m):
        if m > n:return 0 
        
        #
        f = [[0]*(n + 1) for _ in range(n + 1)]
        #如果m和n相等的话，就赋值1
        for i in range(n + 1):
            f[i][i] = 1
        
        #计算顺序
        for i in range(2, n + 1):
            for j in range(1,i):
                for k in range(1,j + 1):
                    f[i][j] = f[i][j] + f[i - j][k]
        
        return f[n][m]