hihoCoder太阁最新面经算法竞赛6 register

Ended

Participants:104

Verdict:Accepted
Score:100 / 100
Submitted:2016-06-29 22:20:28

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
using namespace std;
int dataStack[100], size1;
char operatorStack[100], size2;
char e[110];
int cal()
{
    int a = dataStack[size1];
    int b = dataStack[size1-1];
    char ch = operatorStack[size2];
    switch(ch)
    {
    case '+': return a + b;
    case '-': return b - a;
    case '*': return a * b;
    case '/': return b / a;
    }
}
void pop()
{
    while(size2 > 0 && operatorStack[size2] != '(')
    {
        dataStack[size1-1] = cal();
        --size1;
        --size2;
    }
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX