[Leetcode] 640.Solve the Equation

最新推荐文章于 2022-08-11 22:58:21 发布

Frank_Cui

最新推荐文章于 2022-08-11 22:58:21 发布

阅读量204

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u011144776/article/details/82976059

版权

Leetcode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

    //region 640. Solve the Equation
    public String solveEquation(String equation) {
        //0-x,1-instant
        int[] coefficientArray = {0,0};

        boolean isAfterEqual = false;
        char[] charArray = equation.toCharArray();

        boolean symbol = true;
        int coefficientSub = 1;
        boolean isX = false;
        boolean isFirst = true;
        for(int i = 0; i < charArray.length; i++){
            // if it is '+', '-', '='
            if(isStopSymbol(charArray[i])){
                //if i == 0
                if(i == 0 || charArray[i-1] == '='){
                    if(charArray[i] == '-'){
                        symbol = false;
                    }else {
                        symbol = true;
                    }
                }
                //if i != 0
                else {
                    //if it is '+'
                    if(charArray[i] == '+'){
                        calculate(isAfterEqual,isX,coefficientSubCalculation(coefficientSub, symbol,isX),coefficientArray);
                        symbol = true;
                        coefficientSub = 1;
                        isX = false;
                        isFirst = true;
                    }
                    //if it is '-'
                    else if(charArray[i] == '-'){
                        calculate(isAfterEqual,isX,coefficientSubCalculation(coefficientSub, symbol,isX),coefficientArray);
                        symbol = false;
                        coefficientSub = 1;
                        isX = false;
                        isFirst = true;
                    }
                    //if it is '='
                    else {
                        calculate(isAfterEqual,isX,coefficientSubCalculation(coefficientSub, symbol,isX),coefficientArray);
                        symbol = true;
                        coefficientSub = 1;
                        isX = false;
                        isFirst = true;

                        isAfterEqual = true;
                    }

                }
                continue;
            }
            //if it is '0'~'9'
            if(charArray[i] >= '0' && charArray[i] <= '9'){
                coefficientSub = isFirst ? coefficientSub * (charArray[i] - '0') : coefficientSub*10 + charArray[i] - '0';
                isFirst = false;

                //if it is last digit
                if(i == charArray.length - 1){
                    calculate(isAfterEqual,isX,coefficientSubCalculation(coefficientSub, symbol,isX),coefficientArray);
                    symbol = true;
                    coefficientSub = 1;
                    isX = false;
                    isFirst = true;
                }
                continue;
            }
            //if it is 'x'
            if(charArray[i] == 'x'){
                isX = true;

                //if it is last digit
                if(i == charArray.length - 1){
                    calculate(isAfterEqual,isX,coefficientSubCalculation(coefficientSub, symbol,isX),coefficientArray);
                    symbol = true;
                    coefficientSub = 1;
                    isX = false;
                    isFirst = true;
                }
                continue;
            }
        }

        if(coefficientArray[0] == 0){
            if(coefficientArray[1] == 0){
                return "Infinite solutions";
            }else {
                return "No solution";
            }
        }else {
            return "x=" + coefficientArray[1]/coefficientArray[0];
        }


    }

    public int coefficientSubCalculation(int coefficientSub, boolean symbol, boolean isX){
        //if(isX && coefficientSub == 0){
        //    coefficientSub = 1;
        //}
        return symbol==true?coefficientSub:-coefficientSub;
    }

    public void calculate(boolean isAfterEqual, boolean isX, int coefficientSub,
                          int[] coefficientArray){

        if(isX){
            if(isAfterEqual){
                coefficientArray[0] -= coefficientSub;
            }else {
                coefficientArray[0] += coefficientSub;
            }
        }else {
            if(isAfterEqual){
                coefficientArray[1] += coefficientSub;
            }else {
                coefficientArray[1] -= coefficientSub;
            }

        }
    }

    public boolean isStopSymbol(char c){
        return c == '-' || c == '+' || c == '=';
    }
    //endregion