当前位置:网站首页>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 !
边栏推荐
- Overview of three core areas of Mathematics: algebra
- Embedded point test of app
- Is the test cycle compressed? Teach you 9 ways to deal with it
- Application du Groupe Li dans gtsam
- 测试周期被压缩?教你9个方法去应对
- 对数据安全的思考(转载)
- [postman] collections configuration running process
- 2022 software testing workflow to know
- keil MDK中删除添加到watch1中的变量
- Basic knowledge of error
猜你喜欢

Manage configuration using Nacos

10M25DCF484C8G(FPGA) AMY-6M-0002 BGA GPS模块

【API接口工具】postman-界面使用介绍

Manhattan distance sum - print diamond
![[eolink] PC client installation](/img/91/8b3c4264e544b14f926e91edddf18d.png)
[eolink] PC client installation

D - How Many Answers Are Wrong

ICLR 2022 spotlight | analog transformer: time series anomaly detection method based on correlation difference
![[postman] collections configuration running process](/img/09/bcd9fd6379fa724671ffd09278442e.png)
[postman] collections configuration running process

Full link voltage measurement: building three models

数学三大核心领域概述:代数
随机推荐
How to extract login cookies when JMeter performs interface testing
F - True Liars (种类并查集+DP)
职场进阶指南:大厂人必看书籍推荐
黑猫带你学UFS协议第4篇:UFS协议栈详解
The latest 2022 review of "graph classification research"
Career advancement Guide: recommended books for people in big factories
Left matching principle of joint index
【无App Push 通用测试方案
Coordinatorlayout+nestedscrollview+recyclerview pull up the bottom display is incomplete
Manhattan distance sum - print diamond
IP day 16 VLAN MPLS configuration
模拟卷Leetcode【普通】1061. 按字典序排列最小的等效字符串
【eolink】PC客户端安装
[API interface tool] Introduction to postman interface
MySQL之基础知识
Simulation volume leetcode [general] 1061 Arrange the smallest equivalent strings in dictionary order
Web界面元素的测试
【Postman】动态变量(也称Mock函数)
(中)苹果有开源,但又怎样呢?
Application du Groupe Li dans gtsam