FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/basic-calculator-iii.py at master · cppp/LeetCode-Solutions · GitHub
cppp
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
Python
/
basic-calculator-iii.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
86 lines (76 loc) · 2.73 KB
Breadcrumbs
LeetCode-Solutions
/
Python
/
basic-calculator-iii.py
Copy path
File metadata and controls
86 lines (76 loc) · 2.73 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
85
# Time: O(n)
# Space: O(n)
import
operator
class
Solution
(
object
):
def
calculate
(
self
,
s
):
"""
:type s: str
:rtype: int
"""
def
compute
(
operands
,
operators
):
right
,
left
=
operands
.
pop
(),
operands
.
pop
()
operands
.
append
(
ops
[
operators
.
pop
()](
left
,
right
))
ops
=
{
'+'
:
operator
.
add
,
'-'
:
operator
.
sub
,
'*'
:
operator
.
mul
,
'/'
:
operator
.
div
}
precedence
=
{
'+'
:
0
,
'-'
:
0
,
'*'
:
1
,
'/'
:
1
}
operands
,
operators
,
operand
=
[], [],
0
for
i
in
xrange
(
len
(
s
)):
if
s
[
i
].
isdigit
():
operand
=
operand
*
10
+
int
(
s
[
i
])
if
i
==
len
(
s
)
-
1
or
not
s
[
i
+
1
].
isdigit
():
operands
.
append
(
operand
)
operand
=
0
elif
s
[
i
]
==
'('
:
operators
.
append
(
s
[
i
])
elif
s
[
i
]
==
')'
:
while
operators
[
-
1
]
!=
'('
:
compute
(
operands
,
operators
)
operators
.
pop
()
elif
s
[
i
]
in
precedence
:
while
operators
and
operators
[
-
1
]
in
precedence
and
\
precedence
[
operators
[
-
1
]]
>=
precedence
[
s
[
i
]]:
compute
(
operands
,
operators
)
operators
.
append
(
s
[
i
])
while
operators
:
compute
(
operands
,
operators
)
return
operands
[
-
1
]
# Time: O(n)
# Space: O(n)
class
Solution2
(
object
):
def
calculate
(
self
,
s
):
"""
:type s: str
:rtype: int
"""
operands
,
operators
=
[], []
operand
=
""
for
i
in
reversed
(
xrange
(
len
(
s
))):
if
s
[
i
].
isdigit
():
operand
+=
s
[
i
]
if
i
==
0
or
not
s
[
i
-
1
].
isdigit
():
operands
.
append
(
int
(
operand
[::
-
1
]))
operand
=
""
elif
s
[
i
]
==
')'
or
s
[
i
]
==
'*'
or
s
[
i
]
==
'/'
:
operators
.
append
(
s
[
i
])
elif
s
[
i
]
==
'+'
or
s
[
i
]
==
'-'
:
while
operators
and
\
(
operators
[
-
1
]
==
'*'
or
operators
[
-
1
]
==
'/'
):
self
.
compute
(
operands
,
operators
)
operators
.
append
(
s
[
i
])
elif
s
[
i
]
==
'('
:
while
operators
[
-
1
]
!=
')'
:
self
.
compute
(
operands
,
operators
)
operators
.
pop
()
while
operators
:
self
.
compute
(
operands
,
operators
)
return
operands
[
-
1
]
def
compute
(
self
,
operands
,
operators
):
left
,
right
=
operands
.
pop
(),
operands
.
pop
()
op
=
operators
.
pop
()
if
op
==
'+'
:
operands
.
append
(
left
+
right
)
elif
op
==
'-'
:
operands
.
append
(
left
-
right
)
elif
op
==
'*'
:
operands
.
append
(
left
*
right
)
elif
op
==
'/'
:
operands
.
append
(
left
/
right
)
Back
|
FazBrowse Home
|
New Git URL