递归 PROBLEM3 逆波兰式 ---ACM

weixin_34146986

于 2019-06-27 13:49:55 发布

阅读量257

点赞数

原文链接：http://www.cnblogs.com/ggppwx/archive/2010/05/15/1736381.html

版权

easy quiz

#include <cstdlib>
#include <iostream>
#include <math.h>
/**
*    recursion   PROBLEM 3
*    逆波兰式   calculate reverse polish form
*/
using namespace std;
/**
*   do not use stack;   use recursion is more easy
*/
double exp()    
{
       char a[10];
       scanf("%s",a);   //scan one item (to the next block)
       switch(a[0])
       {
              case '+' : return exp()+exp();
              case '-' : return exp()-exp();
              case '*' : return exp()*exp();
              case '/' : return exp()/exp();
              default :return atof(a);   //string to float
       }

}
int main(int argc, char *argv[])
{
    double answer;
    answer=exp();
    printf("%f",answer);  //output 
    system("PAUSE");
    return EXIT_SUCCESS;
}

转载于:https://www.cnblogs.com/ggppwx/archive/2010/05/15/1736381.html