Function example of php implementing advanced calculator (based on stack)-PHP Tutorial-php.cn

Home

Backend Development

PHP Tutorial

Function example of php implementing advanced calculator (based on stack)

黄舟

Sep 16, 2017 am 09:14 AM

phpcalculatoradvanced

This article mainly introduces the advanced calculator function implemented by PHP based on the stack, involving the definition of the PHP stack and related operating techniques for using the stack to perform numerical operations. Friends in need can refer to the following

Examples of this article PHP stack-based implementation of advanced calculator functions. Share it with everyone for your reference, the details are as follows:

When we get a string operation expression, how should we get its operation result?

At this time we can use the stack algorithm to solve this problem very cleverly.

The idea is this: (We use the PHP function substr loop to intercept this string operation expression, and take out the value of this string in turn [we have to intercept from the first character], we will start to intercept the position Set it as a cyclically growing variable, initialized to [$index=0]). At the same time, we need to create two stacks, one to store numbers [$numStack], and one to store operators [$operStack]. We also need one that can judge Whether it is a function of arithmetic symbols, put each intercepted value into this custom function and return an identifier that can be distinguished as a number or operator. By judging this identifier, it is determined whether the value is a number or an operator. If it is a number, then Insert the number stack, and if it is an operator, insert the symbol stack. If you insert the number stack, you can insert it directly, but the symbol stack needs special processing [[If the symbol stack is empty, insert it directly, not empty: we need to compare the operation priority of the inserted symbol with the symbols in the stack (can be defined A function to determine the symbol priority. Assume * and / are 1 and + and - are assumed to be 0. Assume that larger numbers have higher priority, so you can get the operator priority). When the priority of the symbol to be inserted is less than or equal to The priority of the operator at the top of the stack pops two values from the number stack. Pops an operator from the symbol stack to operate on them]

The following is an example of PHP [refer to the PHP algorithm tutorial by Teacher Han Shunping]

<html>
<head>
<meta http-equiv=&#39;content-type&#39; content=&#39;text/html;charset=utf-8&#39;/>
</head>
<h1 id="高级计算器">高级计算器</h1>
<?php
/**
 * 一个栈类
 */
class MyStack{
      public $top=-1;//默认是-1，表示该栈是空的
      public $maxSize=15;//$maxSize表示栈最大容量
      public $stack=array();//
      //入栈的操作
      public function push($val)
      {
        //先判断栈是否已经满了
        if($this->top==$this->maxSize-1){
          echo &#39;<br/>栈满，不能添加&#39;;
          return;
        }
        $this->top++;
        $this->stack[$this->top]=$val;
      }
      //出栈的操作,就是把栈顶的值取出
      public function pop()
      {
        //判断是否栈空
        if($this->top==-1){
          echo &#39;<br/>栈空1&#39;;
          return;
        }
        //把栈顶的值，取出
        $topVal=$this->stack[$this->top];
        $this->top--;
        return $topVal;
      }
      //显示栈的所有数据的方法.
      public function showStack()
      {
        if($this->top==-1){
          echo &#39;<br/>栈空2&#39;;
          return;
        }
        echo &#39;<br/>当前栈的情况是....&#39;;
        for($i=$this->top;$i>-1;$i--){
          echo &#39;<br/> stack[&#39;.$i.&#39;]=&#39;.$this->stack[$i];
        }
      }
      //判断是否是一个运算符
      public function isOper($val)
      {
        if ($val==&#39;+&#39;||$val==&#39;-&#39;||$val==&#39;*&#39;||$val==&#39;/&#39;)
        {
          return true;
        }
      }
      //判断栈是否为空
      public function isEmpty()
      {
        if ($this->top==-1) return true;
      }
      /**
       * 比较运算符的优先级
       * 我把 * 和/运算符的优先级看作1
       * +和- 看作0
       * 通过它们之间的比较就能得出它们的优先级谁更高
       */
      public function PRI($oper)
      {
        if ($oper==&#39;*&#39;||$oper==&#39;/&#39;)
        {
          return 1;
        } else if ($oper==&#39;+&#39;||$oper==&#39;-&#39;) {
          return 0;
        }
      }
      //返回栈顶端的值
      public function getTop()
      {
        return $this->stack[$this->top];
      }
      //计算
      public function getResult($num1,$num2,$oper)
      {
        switch ($oper)
        {
          case &#39;+&#39;:
            $res = $num2+$num1;
          break;
          case &#39;-&#39;:
            $res = $num2-$num1;
          break;
          case &#39;*&#39;:
            $res = $num2*$num1;
          break;
          case &#39;/&#39;:
            $res = $num2/$num1;
          break;
        }
        return $res;
      }
    }
    //需要进行运算的表达式
    $str = &#39;12+5*2+3-5*2&#39;;
    //字符串的指针
    $index = 0;
    //声明一个用于组合联系数字的变量
    $keepNum = &#39;&#39;;
    //定义一个数栈和一个符号栈
    $numsStack=new MyStack();
    $operStack=new MyStack();
    while (true)
    {
      $val = mb_substr($str,$index,1);
      //如果是一个符号就入符号栈 否则入数栈
      if ($operStack->isOper($val)==true)
      {
        //符号入栈前需要判断一下 栈为空直接入栈 不为空需要比较当前运算符与栈顶端的运算符
        //如果当前运算符的优先级低于栈内的 则需要运算
        if ($operStack->isEmpty())
        {
          $operStack->push($val);
        } else {
           while (!$operStack->isEmpty()&&$operStack->PRI($val)<=$operStack->PRI($operStack->getTop()))
           {
             //当前符号的优先级要直到高于栈内的时候才能入栈 否则要计算
            //当前运算符的优先级低于栈内的 则运算
            $num1 = $numsStack->pop();
            $num2 = $numsStack->pop();
            $oper = $operStack->pop();
            $res = $numsStack->getResult($num1,$num2,$oper);
            //计算完毕将结果入栈
            $numsStack->push($res);
           }
          //把当前这个符号再入符号栈
          $operStack->push($val);
            }
      } else {
        //考虑如果是连续数字的问题
        $keepNum.=$val;
        //先判断是否已经到字符串最后.如果已经到最后，就直接入栈.
        if ($index==mb_strlen($str)-1)
        {
          $numsStack->push($keepNum);//是数字直接入栈
        } else {
          //要判断一下$ch字符的下一个字符是数字还是符号.
          if ($operStack->isOper(mb_substr($str,$index+1,1)))
          {
            $numsStack->push($keepNum);
            $keepNum=&#39;&#39;;
          }
        }
      }
      $index++;//让$index指向下一个字符.
      if ($index==mb_strlen($str)) break;//已扫描到字符串的末尾 就退出while循环
   }
    /*
    4. 当扫描完毕后，就依次弹出数栈和符号栈的数据，并计算，最终留在数栈的值，就是运算结果,只有符号栈不空就一直计算
    */
    while (!$operStack->isEmpty())
    {
      $num1 = $numsStack->pop();
      $num2 = $numsStack->pop();
      $oper = $operStack->pop();
      $res = $numsStack->getResult($num1,$num2,$oper);
      //计算完毕将结果入栈
      $numsStack->push($res);
    }
//当退出while后，在数栈一定有一个数，这个数就是最后结果
echo $str.&#39;=&#39;.$numsStack->getTop();
?>

The above is the detailed content of Function example of php implementing advanced calculator (based on stack). For more information, please follow other related articles on the PHP Chinese website!

Statement

The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

How can you check if a PHP session has already started?Apr 30, 2025 am 12:20 AM

In PHP, you can use session_status() or session_id() to check whether the session has started. 1) Use the session_status() function. If PHP_SESSION_ACTIVE is returned, the session has been started. 2) Use the session_id() function, if a non-empty string is returned, the session has been started. Both methods can effectively check the session state, and choosing which method to use depends on the PHP version and personal preferences.

Describe a scenario where using sessions is essential in a web application.Apr 30, 2025 am 12:16 AM

Sessionsarevitalinwebapplications,especiallyfore-commerceplatforms.Theymaintainuserdataacrossrequests,crucialforshoppingcarts,authentication,andpersonalization.InFlask,sessionscanbeimplementedusingsimplecodetomanageuserloginsanddatapersistence.

How can you manage concurrent session access in PHP?Apr 30, 2025 am 12:11 AM

Managing concurrent session access in PHP can be done by the following methods: 1. Use the database to store session data, 2. Use Redis or Memcached, 3. Implement a session locking strategy. These methods help ensure data consistency and improve concurrency performance.

What are the limitations of using PHP sessions?Apr 30, 2025 am 12:04 AM

PHPsessionshaveseverallimitations:1)Storageconstraintscanleadtoperformanceissues;2)Securityvulnerabilitieslikesessionfixationattacksexist;3)Scalabilityischallengingduetoserver-specificstorage;4)Sessionexpirationmanagementcanbeproblematic;5)Datapersis

Explain how load balancing affects session management and how to address it.Apr 29, 2025 am 12:42 AM

Load balancing affects session management, but can be resolved with session replication, session stickiness, and centralized session storage. 1. Session Replication Copy session data between servers. 2. Session stickiness directs user requests to the same server. 3. Centralized session storage uses independent servers such as Redis to store session data to ensure data sharing.

Explain the concept of session locking.Apr 29, 2025 am 12:39 AM

Sessionlockingisatechniqueusedtoensureauser'ssessionremainsexclusivetooneuseratatime.Itiscrucialforpreventingdatacorruptionandsecuritybreachesinmulti-userapplications.Sessionlockingisimplementedusingserver-sidelockingmechanisms,suchasReentrantLockinJ

Are there any alternatives to PHP sessions?Apr 29, 2025 am 12:36 AM

Alternatives to PHP sessions include Cookies, Token-based Authentication, Database-based Sessions, and Redis/Memcached. 1.Cookies manage sessions by storing data on the client, which is simple but low in security. 2.Token-based Authentication uses tokens to verify users, which is highly secure but requires additional logic. 3.Database-basedSessions stores data in the database, which has good scalability but may affect performance. 4. Redis/Memcached uses distributed cache to improve performance and scalability, but requires additional matching

Define the term 'session hijacking' in the context of PHP.Apr 29, 2025 am 12:33 AM

Sessionhijacking refers to an attacker impersonating a user by obtaining the user's sessionID. Prevention methods include: 1) encrypting communication using HTTPS; 2) verifying the source of the sessionID; 3) using a secure sessionID generation algorithm; 4) regularly updating the sessionID.

See all articles