640. Solve the Equation Leetcode

solveEquation.go

import "strings"
import "strconv"
func solveEquation(equation string) string {
    
    eqnSides := strings.Split(equation, "=")
    leftHandSide, rightHandSide := eqnSides[0], eqnSides[1]
    
    lHV,lHx :=  getSideSum(leftHandSide)
    rHV,rHx :=  getSideSum(rightHandSide)
    if lHx == rHx && lHV == rHV{
        return "Infinite solutions"
    }
    if lHx == rHx {
        return "No solution"
    }
    result := (rHV-lHV)/(lHx-rHx)
    return "x="+strconv.Itoa(result)
}


func getSideSum(side string) (int, int){
    tempNumber := []byte {}
    sum  := 0
    xSum := 0
    for i:= range side{
        if side[i] == '-'|| side[i] == '+' {
            num, err := strconv.Atoi(string(tempNumber))
            if err == nil{
                sum += num
            }else{
                xSum += getXCoff(string(tempNumber))
            }
            tempNumber = []byte{side[i]}
        }else{
            tempNumber = append(tempNumber, side[i])
        }
    } 
    
    num, err := strconv.Atoi(string(tempNumber))
    if err == nil{
        sum += num
    }else{
         xSum += getXCoff(string(tempNumber))
    }
    return sum,xSum
}

func getXCoff(s string)int{
    n := len(s)
    if n==0{
        return 0
    }
    if n == 1 {
        return 1
    }
    if n == 2 && (s[0] == '-' || s[0] == '+'){
        num, _ := strconv.Atoi(s[:n-1]+"1")
        return num
    }
    fmt.Println(s)
    num, _ := strconv.Atoi(s[:n-1])
    return num
}