class Solution {
public int findMinFibonacciNumbers(int k) {
if(k == 0)
return 0;
int a = 1, b = 1;
while(b <= k) {
b += a;
a = b -a;
}
return findMinFibonacciNumbers(k - a) + 1;
}
}
LeetCode 1414和为k的最小斐波切纳数字数目(java)
最新推荐文章于 2024-05-02 12:19:05 发布