• 592. Fraction Addition and Subtraction


    Given a string representing an expression of fraction addition and subtraction, you need to return the calculation result in string format. The final result should be irreducible fraction. If your final result is an integer, say 2, you need to change it to the format of fraction that has denominator 1. So in this case, 2 should be converted to 2/1.

    Example 1:

    Input:"-1/2+1/2"
    Output: "0/1"
    

    Example 2:

    Input:"-1/2+1/2+1/3"
    Output: "1/3"
    

    Example 3:

    Input:"1/3-1/2"
    Output: "-1/6"
    

    Example 4:

    Input:"5/3+1/3"
    Output: "2/1"

    Note:

    1. The input string only contains '0' to '9''/''+' and '-'. So does the output.
    2. Each fraction (input and output) has format ±numerator/denominator. If the first input fraction or the output is positive, then '+'will be omitted.
    3. The input only contains valid irreducible fractions, where the numerator and denominator of each fraction will always be in the range [1,10]. If the denominator is 1, it means this fraction is actually an integer in a fraction format defined above.
    4. The number of given fractions will be in the range [1,10].
    5. The numerator and denominator of the final result are guaranteed to be valid and in the range of 32-bit int.

    Approach #1: Math. [Java]

    class Solution {
        public String fractionAddition(String expression) {
            Scanner sc = new Scanner(expression).useDelimiter("/|(?=[-+])");
            int A = 0, B = 1;
            while (sc.hasNext()) {
                int a = sc.nextInt(), b = sc.nextInt();
                A = A * b + a * B;
                B *= b;
                int g = GCD(A, B);
                A /= g;
                B /= g;
            }
            return A + "/" + B;
        }
        
        public int GCD(int a, int b) {
            return b == 0 ? Math.abs(a) : GCD(b, a%b);
        }
    }
    

      

    Reference:

    https://leetcode.com/problems/fraction-addition-and-subtraction/discuss/103384/Small-simple-C%2B%2BJavaPython

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    leetcode 851. Loud and Rich
    674. 最长连续递增序列
    896. 单调数列
    905. 按奇偶排序数组
    917. 仅仅反转字母
    922. 按奇偶排序数组 II
    925. 长按键入
    929. 独特的电子邮件地址
    933. 最近的请求次数
    自己动手丰衣足食写java贪吃蛇
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10864472.html
Copyright © 2020-2023  润新知