当前位置:网站首页>Simulation volume leetcode [general] 1447 Simplest fraction
Simulation volume leetcode [general] 1447 Simplest fraction
2022-07-06 06:18:00 【Encounter simulation volume】
Summary : Simulation volume Leetcode Summary of questions
1447. Simplest fraction
Give you an integer n , Please return to all 0 To 1 Between ( barring 0 and 1) Satisfy that the denominator is less than or equal to n Of Simplest fraction . The score can be in the form of arbitrarily Sequential return .
Example 1:
Input :n = 2
Output :[“1/2”]
explain :“1/2” Is the only denominator less than or equal to 2 The simplest fraction of .
Example 2:
Input :n = 3
Output :[“1/2”,“1/3”,“2/3”]
Example 3:
Input :n = 4
Output :[“1/2”,“1/3”,“1/4”,“2/3”,“3/4”]
explain :“2/4” It's not the simplest fraction , Because it can be reduced to “1/2” .
Example 4:
Input :n = 1
Output :[]
Tips :
1 <= n <= 100
source : Power button (LeetCode)
link :https://leetcode-cn.com/problems/simplified-fractions
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 simplifiedFractions(self, n: int) -> List[str]:
return [f'{
a}/{
b}' for b in range(1,n+1) for a in range(1,b) if math.gcd(a,b)==1]
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 !
边栏推荐
猜你喜欢

MySQL之基础知识

把el-tree选中的数组转换为数组对象

Technology sharing | common interface protocol analysis

黑猫带你学UFS协议第4篇:UFS协议栈详解

GTSAM中李群的运用

JWT-JSON WEB TOKEN
![[postman] test script writing and assertion details](/img/65/6520fe78bb2b3ff99f16d09ea8c0d1.png)
[postman] test script writing and assertion details

properties文件

Coordinatorlayout+nestedscrollview+recyclerview pull up the bottom display is incomplete
![[postman] the monitors monitoring API can run periodically](/img/9e/3f6150290b868fc1160b6b01d0857e.png)
[postman] the monitors monitoring API can run periodically
随机推荐
数据库-当前读与快照读
模拟卷Leetcode【普通】1218. 最长定差子序列
CoordinatorLayout+NestedScrollView+RecyclerView 上拉底部显示不全
Testing and debugging of multithreaded applications
Hypothesis testing learning notes
GTSAM中李群的運用
JWT-JSON WEB TOKEN
LeetCode 739. 每日温度
Embedded point test of app
技术分享 | 常见接口协议解析
Technology sharing | common interface protocol analysis
还在为如何编写Web自动化测试用例而烦恼嘛?资深测试工程师手把手教你Selenium 测试用例编写
MFC关于长字符串unsigned char与CString转换及显示问题
Postman核心功能解析-参数化和测试报告
【C语言】qsort函数
模拟卷Leetcode【普通】1414. 和为 K 的最少斐波那契数字数目
[API interface tool] Introduction to postman interface
在uni-app中使用腾讯视频插件播放视频
【Tera Term】黑猫带你学TTL脚本——嵌入式开发中串口自动化神技能
Pat (Grade B) 2022 summer exam