simplified-fractions

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

&nbsp;
Example 1:

<pre>
Input: n = 2
Output: [&quot;1/2&quot;]
Explanation: &quot;1/2&quot; is the only unique fraction with a denominator less-than-or-equal-to 2.
</pre>

Example 2:

<pre>
Input: n = 3
Output: [&quot;1/2&quot;,&quot;1/3&quot;,&quot;2/3&quot;]
</pre>

Example 3:

<pre>
Input: n = 4
Output: [&quot;1/2&quot;,&quot;1/3&quot;,&quot;1/4&quot;,&quot;2/3&quot;,&quot;3/4&quot;]
Explanation: &quot;2/4&quot; is not a simplified fraction because it can be simplified to &quot;1/2&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 100</code></li>
</ul>

simplifiedFractions

Simplified Fractions

Math

String

Number Theory

给你一个整数&nbsp;<code>n</code>&nbsp;，请你返回所有 0 到 1 之间（不包括 0 和 1）满足分母小于等于&nbsp;&nbsp;<code>n</code>&nbsp;的 最简&nbsp;分数&nbsp;。分数可以以 任意&nbsp;顺序返回。

&nbsp;

示例 1：

<pre>输入：n = 2
输出：[&quot;1/2&quot;]
解释：&quot;1/2&quot; 是唯一一个分母小于等于 2 的最简分数。</pre>

示例 2：

<pre>输入：n = 3
输出：[&quot;1/2&quot;,&quot;1/3&quot;,&quot;2/3&quot;]
</pre>

示例 3：

<pre>输入：n = 4
输出：[&quot;1/2&quot;,&quot;1/3&quot;,&quot;1/4&quot;,&quot;2/3&quot;,&quot;3/4&quot;]
解释：&quot;2/4&quot; 不是最简分数，因为它可以化简为 &quot;1/2&quot; 。</pre>

示例 4：

<pre>输入：n = 1
输出：[]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 100</code></li>
</ul>