1 Star 0 Fork 332

大宇 / leetcode

forked from doocs / leetcode 
加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
README_EN.md 1.49 KB
一键复制 编辑 原始数据 按行查看 历史
ylb 提交于 2021-04-22 11:34 . feat: use relative path

1447. Simplified Fractions

中文文档

Description

Given an integer n, return a list of all simplified fractions between 0 and 1 (exclusive) such that the denominator is less-than-or-equal-to n. The fractions can be in any order.

 

Example 1:


Input: n = 2

Output: ["1/2"]

Explanation: "1/2" is the only unique fraction with a denominator less-than-or-equal-to 2.

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"]

Explanation: "2/4" is not a simplified fraction because it can be simplified to "1/2".

Example 4:


Input: n = 1

Output: []

 

Constraints:

  • 1 <= n <= 100

Solutions

Python3

Java

...

马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/fdayu/leetcode.git
git@gitee.com:fdayu/leetcode.git
fdayu
leetcode
leetcode
main

搜索帮助

344bd9b3 5694891 D2dac590 5694891