Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g1401_1500.s1447_simplified_fractions.Solution

```
public class Solution
extends Object
```
1447 - Simplified Fractions.
Medium

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. You can return the answer 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”.

Constraints:
- 1 <= n <= 100

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<String> simplifiedFractions(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

simplifiedFractions

public List<String> simplifiedFractions(int n)