N choose K combinations

recursive_combination.py

def find_combinations(n, k):
    """
    Args:
     n(int32)
     k(int32)
    Returns:
     list_list_int32
    """
    array = list(range(1,n+1))
    result = set()
    for idx, num in enumerate(array):
        do_find_combinations(result, array[idx+1:], [num], k, k-1)
    return [list(x) for x in result]


def do_find_combinations(result, array, acc, count, k):
    if k == 0:
        result.add(tuple(acc))
    for idx, num in enumerate(array):
        do_find_combinations(result, array[idx+1:], acc + [num], count, k-1)