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

判斷每個(gè)可能的分?jǐn)?shù)，那么就要挨個(gè)去遍歷，但是考慮到1/2跟2/4是一樣的，所以就要求最大公約數(shù)，GCD，我又卡在這里了，還好不難，剩下的就是避免重復(fù)，要用hashset去依次判斷，然后返回即可；

下面是代碼：

Hide Hint 1

A fraction is fully simplified if there is no integer that divides cleanly into the numerator and denominator.

Hide Hint 2

In other words the greatest common divisor of the numerator and the denominator of a simplified fraction is 1.

Problems

Pick One

Prev

Runtime:?44 ms, faster than?19.02%?of?Java?online submissions for?Simplified Fractions.

Memory Usage:?45.2 MB, less than?6.75%?of?Java?online submissions for?Simplified Fractions.