Simplified Fractions

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: []

思路:先求出所有的解,然后求每个解的最大公约数,然后去重复;

class Solution {
    public List<String> simplifiedFractions(int n) {
        List<String> list = new ArrayList<String>();
        List<String> candidates = generateAllCandidate(n);
        HashSet<String> visited = new HashSet<>();
        return filter(candidates, visited);
    }
    
    private List<String> filter(List<String> candidates, HashSet<String> visited) {
        List<String> result = new ArrayList<String>();
        for(String candidate: candidates) {
            String finalstr = filtering(candidate);
            if(!visited.contains(finalstr)) {
                visited.add(finalstr);
                result.add(finalstr);
            }    
        }
        return result;
    }
    
    private String filtering(String str) {
        String[] splits = str.split("/");
        int a = Integer.parseInt(splits[0]);
        int b = Integer.parseInt(splits[1]);
        int gcd = gcd(a, b);
        a = a / gcd;
        b = b / gcd;
        return build(a, b);
    }
    
    private int gcd(int p, int q) {
        if(q == 0) {
            return p;
        }
        return gcd(q, p % q);
    }
    
    private List<String> generateAllCandidate(int n) {
        List<String> list = new ArrayList<String>();
        for(int i = n; i > 1; i--) {
            for(int j = i - 1; j >= 1; j--) {
                list.add(build(j, i));
            }
        }
        return list;
    }
    
    private String build(int a, int b) {
        StringBuilder sb = new StringBuilder();
        sb.append(a).append("/").append(b);
        return sb.toString();
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值