力扣：640. 求解方程

最新推荐文章于 2024-07-09 23:43:07 发布

what is an object

最新推荐文章于 2024-07-09 23:43:07 发布

阅读量43

点赞数

分类专栏：菜鸟刷题记录算法文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/newOneObject/article/details/126276534

版权

算法同时被 2 个专栏收录

278 篇文章 1 订阅

订阅专栏

菜鸟刷题记录

204 篇文章 1 订阅

订阅专栏

class Solution {
    public String solveEquation(String equation) {
        int factor = 0, val = 0;
        int index = 0, n = equation.length(), sign1 = 1;
        while (index < n){
            if (equation.charAt(index) == '='){
                sign1 = -1; // 等式右边变成负数
                index++;
                continue;
            }

            int sign2 = sign1, number = 0;
            boolean valid = false; //记录number是否有效
            if (equation.charAt(index) == '-' || equation.charAt(index) == '+'){
                sign2 = equation.charAt(index) == '-' ? -sign1 : sign1;
                index++;
            }
            while (index < n && Character.isDigit(equation.charAt(index))){
                number = number * 10 + (equation.charAt(index) - '0');
                index++;
                valid = true;
            }

            if (index < n && equation.charAt(index) == 'x'){
                factor += valid ? sign2 * number : sign2;
                index++;
            } else {
                val += sign2 * number;
            }
        }
        if (factor == 0){
            return val == 0 ?  "Infinite solutions" : "No solution";
        }
        return "x=" + (-val / factor);
    }
}