1447. Simplified Fractions

Posted on Edited on In

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. You can return the answer in any order .

Example 1:

1
2
3
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:

1
2
Input: n = 3
Output: ["1/2","1/3","2/3"]

Example 3:

1
2
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

Hints/Notes

Solution

Language: C++

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
    unordered_set<string> s;

    vector<string> simplifiedFractions(int n) {
        if (n == 1) {
            return {};
        }
        for (int i = 2; i <= n; i++) {
            for (int j = 1; j < i; j++) {
                int g = gcd(i, j);
                s.insert(to_string(j / g) + "/" + to_string(i / g));
            }
        }
        return vector<string>(s.begin(), s.end());
    }
};