Postfix expressions(Data Structure)
来源:互联网 发布:网络推手汇航 编辑:程序博客网 时间:2024/06/04 19:11
Input
Integer is the first line,the number of the test caseis t.
Following t lines, each line is a string whose length does not exceed 100, representing a Postfix expression. Expression containing only +,-, *,/four operators and the 26 lowercase letters of the alphabet, does not contain other characters. Each letter represents a positive integer:
a = 1,b = 2,c = 3…y = 25,z = 26.
Output
Each input sample, single line output: Postfix expression value, a positive real number s, to two decimal places.
Case
Sample Input
2ab+c*int**py++
Sample Output
9.002561.00
Using the stack
to solve the problem,if the traverse run into the letters, then push into the stack
,otherwise, let the top element in the stack
make the operations to the next letter,then push the result into thestack
.
Finally,output the number with two decimal places, using fixed
and setprecision(2)
.
code (Hope have a help to you)
#include<iostream>#include<string>#include<stack>#include <iomanip>using namespace std;int main() { int n; cin >> n; while (n--) { stack<float> temp; string str; cin >> str; int size = str.length(); for (int i = 0; i < size; i++) { if (str[i] == '+' || str[i] == '-' || str[i] == '*' || str[i] == '/') { float a = temp.top(); temp.pop(); float b = temp.top(); temp.pop(); if (str[i] == '+') { b += a; temp.push(b); } else if (str[i] == '-') { b -= a; temp.push(b); } else if (str[i] == '*') { b *= a; temp.push(b); } else if (str[i] == '/') { b /= a; temp.push(b); } } else { temp.push(str[i]-'a'+1); } } cout<<fixed<<setprecision(2)<<temp.top()<<endl; }}
- Postfix expressions(Data Structure)
- Data Structure
- Data structure
- Data Structure
- Data structure
- Data structure
- data structure
- Data Structure
- Data structure
- Data Structure
- Data Structure
- Data Structure
- Data Structure
- Data structure alignmentData structure alignment
- Data types,Operators,Expressions
- Finish Data Structure Examination
- 【OPENGL】DEVMODE data structure
- Critical Data Structure -- sk_buff
- mysql 自定义hash索引
- MapReduce 例子
- Java中HashMap中对value对象进行排序
- iOS推送
- LXH必备技能
- Postfix expressions(Data Structure)
- 用c语言验证哥德巴赫猜想
- webpagetest网站性能分析
- leetCode练习(34)
- info of me
- 个人开发的独立小游戏《贪吃的猫》终于在应用宝上架了
- 设计模式--工厂模式Factory(创建型)
- c语言二维数组的传递
- 编程之美2.14求数组的子数组之和的最大值Java版