当前位置:网站首页>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 !
边栏推荐
- 【Postman】Collections配置运行过程
- Is the test cycle compressed? Teach you 9 ways to deal with it
- win10无法操作(删除、剪切)文件
- Customize the gateway filter factory on the specified route
- D - How Many Answers Are Wrong
- On weak network test of special test
- Manhattan distance and Manhattan rectangle - print back font matrix
- Application du Groupe Li dans gtsam
- 在uni-app中使用腾讯视频插件播放视频
- Online and offline problems
猜你喜欢
随机推荐
在线问题与离线问题
【Postman】Monitors 监测API可定时周期运行
B - The Suspects
数据库-当前读与快照读
【Postman】Collections配置运行过程
异常检测方法总结
联合索引的左匹配原则
MySQL之数据类型
模拟卷Leetcode【普通】1314. 矩阵区域和
PAT(乙级)2022年夏季考试
ICLR 2022 spotlight | analog transformer: time series anomaly detection method based on correlation difference
Manage configuration using Nacos
JWT-JSON WEB TOKEN
F - true liars (category and search set +dp)
Coordinatorlayout+nestedscrollview+recyclerview pull up the bottom display is incomplete
Basic knowledge of error
Qt:无法定位程序输入点XXXXX于动态链接库。
Thoughts on data security (Reprint)
模拟卷Leetcode【普通】1414. 和为 K 的最少斐波那契数字数目
leetcode 24. 两两交换链表中的节点


![[eolink] PC client installation](/img/91/8b3c4264e544b14f926e91edddf18d.png)






