当前位置:网站首页>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 !
边栏推荐
- Full link voltage measurement: building three models
- JWT-JSON WEB TOKEN
- 在线问题与离线问题
- Leaflet map
- Cannot create PoolableConnectionFactory (Could not create connection to database server. 错误
- 还在为如何编写Web自动化测试用例而烦恼嘛?资深测试工程师手把手教你Selenium 测试用例编写
- PAT(乙级)2022年夏季考试
- Database - current read and snapshot read
- 浅谈专项测试之弱网络测试
- G - Supermarket
猜你喜欢

ESP32 ESP-IDF看门狗TWDT

B - The Suspects

Nodejs realizes the third-party login of Weibo

Win10 cannot operate (delete, cut) files

G - Supermarket

数据库隔离级别

Hypothesis testing learning notes

F - true liars (category and search set +dp)

Technology sharing | common interface protocol analysis

Expose the serial fraudster Liu Qing in the currency circle, and default hundreds of millions of Cheng Laolai
随机推荐
LeetCode 739. 每日温度
黑猫带你学UFS协议第18篇:UFS如何配置逻辑单元(LU Management)
Nodejs realizes the third-party login of Weibo
Understanding of processes and threads
[no app push general test plan
技术分享 | 常见接口协议解析
模拟卷Leetcode【普通】1405. 最长快乐字符串
php使用redis实现分布式锁
leetcode 24. 两两交换链表中的节点
Significance of unit testing
Réflexions sur la sécurité des données (réimpression)
Pat (Grade B) 2022 summer exam
Aike AI frontier promotion (2.13)
Overview of three core areas of Mathematics: algebra
【eolink】PC客户端安装
Summary of anomaly detection methods
【Tera Term】黑猫带你学TTL脚本——嵌入式开发中串口自动化神技能
LeetCode 1200. 最小绝对差
F - True Liars (种类并查集+DP)
浅谈专项测试之弱网络测试