当前位置:网站首页>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 !
边栏推荐
- Interface test: what are the components of the URL in fiddler
- 数据库隔离级别
- Buuctf-[bjdctf2020]zjctf, but so (xiaoyute detailed explanation)
- Fault, error, failure of functional safety
- 10m25dcf484c8g (FPGA) amy-6m-0002 BGA GPS module
- 黑猫带你学UFS协议第18篇:UFS如何配置逻辑单元(LU Management)
- Understanding of processes and threads
- 【Postman】测试(Tests)脚本编写和断言详解
- leetcode 24. 两两交换链表中的节点
- Application of Lie group in gtsam
猜你喜欢

isam2运行流程

JMeter做接口测试,如何提取登录Cookie

Detailed explanation of P problem, NP problem, NPC problem and NP hard problem

GTSAM中李群的运用

Overview of three core areas of Mathematics: algebra

LeetCode 739. 每日温度

Function of activation function

【Postman】Monitors 监测API可定时周期运行

Application du Groupe Li dans gtsam

把el-tree选中的数组转换为数组对象
随机推荐
Still worrying about how to write web automation test cases? Senior test engineers teach you selenium test case writing hand in hand
E - food chain
Significance of unit testing
使用Nacos管理配置
进程和线程的理解
[API interface tool] Introduction to postman interface
Digital triangle model acwing 1015 Picking flowers
在线问题与离线问题
数据库隔离级别
selenium源码通读·9 |DesiredCapabilities类分析
Manhattan distance sum - print diamond
GTSAM中李群的运用
二维码的前世今生 与 六大测试点梳理
LeetCode 731. 我的日程安排表 II
[C language] string left rotation
Expose the serial fraudster Liu Qing in the currency circle, and default hundreds of millions of Cheng Laolai
数据库-当前读与快照读
Full link voltage measurement: building three models
职场进阶指南:大厂人必看书籍推荐
B - The Suspects