forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cs
84 lines (80 loc) · 2.4 KB
/
Solution.cs
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
using System.Collections.Generic;
using System.Linq;
struct Element
{
public char Op;
public int Number;
public Element(char op, int number)
{
Op = op;
Number = number;
}
}
public class Solution {
public int Calculate(string s) {
var stack = new Stack<Element>();
var readingNumber = false;
var number = 0;
var op = '+';
foreach (var ch in ((IEnumerable<char>)s).Concat(Enumerable.Repeat('+', 1)))
{
if (ch >= '0' && ch <= '9')
{
if (!readingNumber)
{
readingNumber = true;
number = 0;
}
number = (number * 10) + (ch - '0');
}
else if (ch != ' ')
{
readingNumber = false;
if (op == '+' || op == '-')
{
if (stack.Count == 2)
{
var prev = stack.Pop();
var first = stack.Pop();
if (prev.Op == '+')
{
stack.Push(new Element(first.Op, first.Number + prev.Number));
}
else // '-'
{
stack.Push(new Element(first.Op, first.Number - prev.Number));
}
}
stack.Push(new Element(op, number));
}
else
{
var prev = stack.Pop();
if (op == '*')
{
stack.Push(new Element(prev.Op, prev.Number * number));
}
else // '/'
{
stack.Push(new Element(prev.Op, prev.Number / number));
}
}
op = ch;
}
}
if (stack.Count == 2)
{
var second = stack.Pop();
var first = stack.Pop();
if (second.Op == '+')
{
stack.Push(new Element(first.Op, first.Number + second.Number));
}
else // '-'
{
stack.Push(new Element(first.Op, first.Number - second.Number));
}
}
return stack.Peek().Number;
}
}