def fibonacci(self, n):
        """
        For loop in a functional way
        :param n: an integer
        :return: an integer f(n)
        """
        f = lambda n: reduce(lambda x, n: [x[1], x[0]+x[1]], range(n), [0, 1])[0]  # reduce(func, itr, accumulator)
        return f(n-1)
dataset/ETHPy150Open algorhythms/LintCode/Fibonacci.py/Solution.fibonacci/original