当前位置:网站首页>Simulation volume leetcode [general] 1414 The minimum number of Fibonacci numbers with a sum of K
Simulation volume leetcode [general] 1414 The minimum number of Fibonacci numbers with a sum of K
2022-07-06 06:18:00 【Encounter simulation volume】
Summary : Simulation volume Leetcode Summary of questions
1414. And for K The minimum number of Fibonacci Numbers
Here are the numbers k , Please return and for k The minimum number of Fibonacci numbers , among , Each Fibonacci number can be used many times .
Fibonacci numbers are defined as :
F1 = 1
F2 = 1
Fn = Fn-1 + Fn-2 , among n > 2 .
Data guarantee for a given k , A feasible solution must be found .
Example 1:
Input :k = 7
Output :2
explain : Fibonacci number is :1,1,2,3,5,8,13,……
about k = 7 , We can get 2 + 5 = 7 .
Example 2:
Input :k = 10
Output :2
explain : about k = 10 , We can get 2 + 8 = 10 .
Example 3:
Input :k = 19
Output :3
explain : about k = 19 , We can get 1 + 5 + 13 = 19 .
Tips :
1 <= k <= 10^9
source : Power button (LeetCode)
link :https://leetcode-cn.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .
Code :
from leetcode_python.utils import *
class Solution:
def findMinFibonacciNumbers(self, k: int) -> int:
f = [1,1]
while f[-1]<k:f.append(f[-1]+f[-2])
res,i = 0,len(f)-1
while k:
if k>=f[i]:
k-=f[i]
res+=1
i-=1
return res
def test(data_test):
s = Solution()
data = data_test # normal
# data = [list2node(data_test[0])] # list turn node
return s.getResult(*data)
def test_obj(data_test):
result = [None]
obj = Solution(*data_test[1][0])
for fun, data in zip(data_test[0][1::], data_test[1][1::]):
if data:
res = obj.__getattribute__(fun)(*data)
else:
res = obj.__getattribute__(fun)()
result.append(res)
return result
if __name__ == '__main__':
datas = [
[],
]
for data_test in datas:
t0 = time.time()
print('-' * 50)
print('input:', data_test)
print('output:', test(data_test))
print(f'use time:{
time.time() - t0}s')
remarks :
GitHub:https://github.com/monijuan/leetcode_python
CSDN Summary : Simulation volume Leetcode Summary of questions
You can add QQ Group communication :1092754609
leetcode_python.utils See the description on the summary page for details
First brush questions , Then generated by script blog, If there is any mistake, please leave a message , I see it will be revised ! thank you !
边栏推荐
- Understanding of processes and threads
- Detailed explanation of P problem, NP problem, NPC problem and NP hard problem
- Pat (Grade B) 2022 summer exam
- Embedded point test of app
- 这些年用Keil遇到的坑
- Function of activation function
- 测试周期被压缩?教你9个方法去应对
- GTSAM中李群的运用
- Caused by:org. gradle. api. internal. plugins . PluginApplicationException: Failed to apply plugin
- [C language] string left rotation
猜你喜欢
Detailed explanation of P problem, NP problem, NPC problem and NP hard problem
[wechat applet] build a development tool environment
P问题、NP问题、NPC问题、NP-hard问题详解
G - Supermarket
Win10 cannot operate (delete, cut) files
B - The Suspects
【C语言】字符串左旋
LeetCode 732. 我的日程安排表 III
Selenium source code read through · 9 | desiredcapabilities class analysis
[postman] collections configuration running process
随机推荐
GTSAM中ISAM2和IncrementalFixedLagSmoother说明
Overview of three core areas of Mathematics: geometry
GTSAM中李群的運用
D - How Many Answers Are Wrong
一文揭开,测试外包公司的真 相
Leaflet map
【Postman】Collections-运行配置之导入数据文件
Software test interview questions - Test Type
LeetCode 732. 我的日程安排表 III
[ram IP] introduction and experiment of ram IP core
LeetCode 1200. 最小绝对差
Customize the gateway filter factory on the specified route
Aike AI frontier promotion (2.13)
在uni-app中使用腾讯视频插件播放视频
Postman核心功能解析-参数化和测试报告
测试周期被压缩?教你9个方法去应对
Digital triangle model acwing 1015 Picking flowers
模拟卷Leetcode【普通】1218. 最长定差子序列
[no app push general test plan
异常检测方法总结