递归-进制转换

def func1(n, base):
    convertion = '0123456789ABCDE'
    if n < base:
        return convertion[n]
    else:
        return func1(n // base, base) + convertion[n % base]


def func2(n, base):
    if n < base:
        return ''.join([str(n)])
    else:
        return ''.join([str(func2(n // base, base)), str(n % base)])


if __name__ == '__main__':
    print(func1(44, 8))
    print(func2(44, 8))