<p>Given a string <code>s</code> representing a valid expression, implement a basic calculator to evaluate it, and return <em>the result of the evaluation</em>.</p>

<p><strong>Note:</strong> You are <strong>not</strong> allowed to use any built-in function which evaluates strings as mathematical expressions, such as <code>eval()</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;1 + 1&quot;
<strong>Output:</strong> 2
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot; 2-1 + 2 &quot;
<strong>Output:</strong> 3
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;(1+(4+5+2)-3)+(6+8)&quot;
<strong>Output:</strong> 23
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 3 * 10<sup>5</sup></code></li>
	<li><code>s</code> consists of digits, <code>&#39;+&#39;</code>, <code>&#39;-&#39;</code>, <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code>, and <code>&#39; &#39;</code>.</li>
	<li><code>s</code> represents a valid expression.</li>
	<li><code>&#39;+&#39;</code> is <strong>not</strong> used as a unary operation (i.e., <code>&quot;+1&quot;</code> and <code>&quot;+(2 + 3)&quot;</code> is invalid).</li>
	<li><code>&#39;-&#39;</code> could be used as a unary operation (i.e., <code>&quot;-1&quot;</code> and <code>&quot;-(2 + 3)&quot;</code> is valid).</li>
	<li>There will be no two consecutive operators in the input.</li>
	<li>Every number and running calculation will fit in a signed 32-bit integer.</li>
</ul>

from collections import deque
class Solution:
    def calculate(self, s: str) -> int:
        queue = deque([])
        n = ''
        symbols = '+-()'
        for item in list(s):
            if item in symbols:
                if n:
                    queue.append(int(n))
                    n = ''
                queue.append(item)
            elif item == ' ':
                continue
            else:
                n+=item
            if item == ')':
                queue.pop()
                temp_num = []
                temp_symbol = []
                while queue[-1] != '(':
                    if type(queue[-1])!=int:
                        temp_symbol.append(queue.pop())
                    else:
                        temp_num.append(queue.pop())
                queue.pop()
                if len(temp_num) > len(temp_symbol):
                    cur = temp_num.pop()
                else:
                    cur = 0
                while temp_symbol:
                    operation = temp_symbol.pop()
                    if operation == '+':
                        cur += temp_num.pop()
                    else:
                        cur -= temp_num.pop()
                queue.append(cur)
        if n:
            queue.append(int(n))
            n = ''
        if len(queue) == 1:
            return queue[0]
        elif queue:
            temp_num = []
            temp_symbol = []
            while queue:
                if type(queue[-1])!=int:
                    temp_symbol.append(queue.pop())
                else:
                    temp_num.append(queue.pop())
            if len(temp_num) > len(temp_symbol):
                cur = temp_num.pop()
            else:
                cur = 0
            while temp_symbol:
                operation = temp_symbol.pop()
                if operation == '+':
                    cur += temp_num.pop()
                else:
                    cur -= temp_num.pop()
            return cur


        

        
19600