Find the Minimum Number of Fibonacci Numbers Whose Sum Is K LeetCode solution in Python

1
class Solution:
2
    def findMinFibonacciNumbers(self, k: int) -> int:
3
        fib_sq = [1, 1]
4
        while fib_sq[-1] + fib_sq[-2] <= k:
5
            fib_sq.append(fib_sq[-1] + fib_sq[-2])
6
        counter = 0
7
        for i in range(len(fib_sq) - 1, -1, -1):
8
            if fib_sq[i] <= k:
9
                counter += 1
10
                k -= fib_sq[i]
11
        return counter