LeetCode题解(0640):求解一元一次方程(Python)

题目:原题链接(中等)

标签:数学、字符串

解法时间复杂度空间复杂度执行用时
Ans 1 (Python) O ( N ) O(N) O(N) O ( N ) O(N) O(N)40ms (52.71%)
Ans 2 (Python)
Ans 3 (Python)

解法一:

class Solution:
    def solveEquation(self, equation: str) -> str:
        def count(ss):
            aa, bb = 0, 0
            flag = 1 if ss[0] == "+" else -1
            if "x" in ss:
                s = now[1:].replace("x", "")
                aa = flag * (int(s) if s else 1)
            else:
                bb = flag * int(ss[1:])
            return aa, bb

        equation1, equation2 = equation.split("=")
        if equation1[0] != "-" and equation1[0] != "+":
            equation1 = "+" + equation1
        if equation2[0] != "-" and equation2[0] != "+":
            equation2 = "+" + equation2

        a, b = 0, 0

        # 计算等号左边
        now = ""
        for ch in equation1:
            if ch == "+" or ch == "-":
                if now:
                    c, d = count(now)
                    a += c
                    b += d
                now = ch
            else:
                now += ch
        c, d = count(now)
        a += c
        b += d

        # 计算等号右边
        now = ""
        for ch in equation2:
            if ch == "+" or ch == "-":
                if now:
                    c, d = count(now)
                    a -= c
                    b -= d
                now = ch
            else:
                now += ch
        c, d = count(now)
        a -= c
        b -= d

        # 计算结果
        if a == 0:
            if b == 0:
                return "Infinite solutions"
            else:
                return "No solution"
        else:
            return "x=" + str(-b // a)
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

长行

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值