在 JavaScript 中考虑运算符优先级评估数学表达式-js教程-PHP中文网

在 JavaScript 中考虑运算符优先级评估数学表达式

WBOY

发布： 2023-08-24 15:53:09

转载

1069 人浏览过

在 JavaScript 中考虑运算符优先级评估数学表达式

问题

我们需要编写一个 JavaScript 函数，它将数学表达式作为字符串接收，并将其结果作为数字返回。

我们需要支持以下数学运算符 -

除法 /（作为浮点除法）
加法 + p>
减法 -
乘法 *

运算符始终根据从左到右，* 和 / 必须在 + 和 - 之前计算。

示例

以下是代码 -

实时演示

const exp = &#39;6 - 4&#39;;
const findResult = (exp = &#39;&#39;) => {
   const digits = &#39;0123456789.&#39;;
   const operators = [&#39;+&#39;, &#39;-&#39;, &#39;*&#39;, &#39;/&#39;, &#39;negate&#39;];
   const legend = {
      &#39;+&#39;: { pred: 2, func: (a, b) => { return a + b; }, assoc: "left" },
      &#39;-&#39;&: { pred: 2, func: (a, b) => { return a - b; }, assoc: "left" },
      &#39;*&#39;: { pred: 3, func: (a, b) => { return a * b; }, assoc: "left" },
      &#39;/&#39;: { pred: 3, func: (a, b) => {
      if (b != 0) { return a / b; } else { return 0; }
   }
   }, assoc: "left",
   &#39;negate&#39;: { pred: 4, func: (a) => { return -1 * a; }, assoc: "right" }
};
exp = exp.replace(/\s/g, &#39;&#39;);
let operations = [];
let outputQueue = [];
let ind = 0;
let str = &#39;&#39;;
while (ind < exp.length) {
   let ch = exp[ind];
   if (operators.includes(ch)) {
      if (str !== &#39;&#39;) {
         outputQueue.push(new Number(str));
         str = &#39;&#39;;
      }
      if (ch === &#39;-&#39;) {
         if (ind == 0) {
            ch = &#39;negate&#39;;
         } else {
            let nextCh = exp[ind+1];
            let prevCh = exp[ind-1];
            if ((digits.includes(nextCh) || nextCh === &#39;(&#39; || nextCh === &#39;-&#39;) &&
               (operators.includes(prevCh) || exp[ind-1] === &#39;(&#39;)) {
                  ch = &#39;negate&#39;;
            }
         }
      }
      if (operations.length > 0) {
         let topOper = operations[operations.length - 1];
         while (operations.length > 0 && legend[topOper] &&
         ((legend[ch].assoc === &#39;left&#39; && legend[ch].pred <= legend[topOper].pred) ||
         (legend[ch].assoc === &#39;right&#39; && legend[ch].pred < legend[topOper].pred))) {
            outputQueue.push(operations.pop());
            topOper = operations[operations.length - 1];
         }
      }
      operations.push(ch);
   } else if (digits.includes(ch)) {
      str += ch
   } else if (ch === &#39;(&#39;) {
      operations.push(ch);
   } else if (ch === &#39;)&#39;) {
      if (str !== &#39;&#39;) {
         outputQueue.push(new Number(str));
         str = &#39;&#39;;
      }
      while (operations.length > 0 && operations[operations.length - 1] !== &#39;(&#39;) {
         outputQueue.push(operations.pop());
      }
      if (operations.length > 0) { operations.pop(); }
   }
   ind++;
}
if (str !== &#39;&#39;) { outputQueue.push(new Number(str)); }
   outputQueue = outputQueue.concat(operations.reverse())
   let res = [];
   while (outputQueue.length > 0) {
      let ch = outputQueue.shift();
      if (operators.includes(ch)) {
         let num1, num2, subResult;
         if (ch === &#39;negate&#39;) {
            res.push(legend[ch].func(res.pop()));
         } else {
            let [num2, num1] = [res.pop(), res.pop()];
            res.push(legend[ch].func(num1, num2));
         }
      } else {
         res.push(ch);
      }
   }
   return res.pop().valueOf();
};
console.log(findResult(exp));

登录后复制