golang 解法, 执行用时: 0 ms, 内存消耗: 1.8 MB, 提交时间: 2023-09-07 11:22:31

func isRationalEqual(s string, t string) bool {
	s_arr_dot := strings.Split(s, ".")
	t_arr_dot := strings.Split(t, ".")

	// 先获取整数部分
	sf, _ := strconv.ParseFloat(s_arr_dot[0], 64)
	tf, _ := strconv.ParseFloat(t_arr_dot[0], 64)

	// 把小数点后的值加回来
	fn(&sf, s_arr_dot)
	fn(&tf, t_arr_dot)

	return abs(sf-tf) < 1e-10
}

func fn(sf *float64, s_arr_dot []string) {
	if len(s_arr_dot) > 1 && s_arr_dot[1] != "" { // '.' 后还有数值
		s_arr_p := strings.Split(s_arr_dot[1], "(")
		if len(s_arr_p) == 1 || (len(s_arr_p) > 1 && s_arr_p[0] != "") { // '.' 后存在不循环部分
			tmp, _ := strconv.ParseFloat(s_arr_p[0], 64)
			*sf += tmp / math.Pow10(len(s_arr_p[0]))
		}
		if len(s_arr_p) > 1 && s_arr_p[1] != "" { // 有循环部分
			n := strings.Split(s_arr_p[1], ")")[0]
			tmp, _ := strconv.ParseFloat(n, 64)
			nf := tmp / math.Pow10(len(s_arr_p[0])+len(n))
			nf = nf / (1 - 1/math.Pow10(len(n))) // 等比数列求和
			*sf += nf
		}
	}
}

func abs(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

java 解法, 执行用时: 4 ms, 内存消耗: 39.7 MB, 提交时间: 2023-09-07 11:21:49

class Solution {
    public boolean isRationalEqual(String S, String T) {
        Fraction f1 = convert(S);
        Fraction f2 = convert(T);
        return f1.n == f2.n && f1.d == f2.d;
    }

    public Fraction convert(String S) {
        int state = 0; //whole, decimal, repeating
        Fraction ans = new Fraction(0, 1);
        int decimal_size = 0;

        for (String part: S.split("[.()]")) {
            state++;
            if (part.isEmpty()) continue;
            long x = Long.valueOf(part);
            int sz = part.length();

            if (state == 1) { // whole
                 ans.iadd(new Fraction(x, 1));
            } else if (state == 2) { // decimal
                 ans.iadd(new Fraction(x, (long) Math.pow(10, sz)));
                 decimal_size = sz;
            } else { // repeating
                 long denom = (long) Math.pow(10, decimal_size);
                 denom *= (long) (Math.pow(10, sz) - 1);
                 ans.iadd(new Fraction(x, denom));
            }
        }
        return ans;
    }
}

class Fraction {
    long n, d;
    Fraction(long n, long d) {
        long g = gcd(n, d);
        this.n = n / g;
        this.d = d / g;
    }

    public void iadd(Fraction other) {
        long numerator = this.n * other.d + this.d * other.n;
        long denominator = this.d * other.d;
        long g = Fraction.gcd(numerator, denominator);
        this.n = numerator / g;
        this.d = denominator / g;
    }

    static long gcd(long x, long y) {
        return x != 0 ? gcd(y % x, x) : y;
    }
}

python3 解法, 执行用时: 36 ms, 内存消耗: 15.9 MB, 提交时间: 2023-09-07 11:21:25

from fractions import Fraction

class Solution:
    def isRationalEqual(self, s: str, t: str) -> bool:
        def convert(S: str) -> int:
            if '.' not in S:
                return Fraction(int(S), 1)
            i = S.index('.')
            ans = Fraction(int(S[:i]), 1)
            S = S[i+1:]
            if '(' not in S:
                if S:
                    ans += Fraction(int(S), 10 ** len(S))
                return ans

            i = S.index('(')
            if i:
                ans += Fraction(int(S[:i]), 10 ** i)
            S = S[i+1:-1]
            j = len(S)
            ans += Fraction(int(S), 10**i * (10**j - 1))
            return ans

        return convert(s) == convert(t)