2011. Final Value of Variable After Performing Operations
Description
There is a programming language with only four operations and one variable X
:
++X
andX++
increments the value of the variableX
by1
.X
andX
decrements the value of the variableX
by1
.
Initially, the value of X
is 0
.
Given an array of strings operations
containing a list of operations, return the final value of X
after performing all the operations.
Example 1:
Input: operations = ["X","X++","X++"] Output: 1 Explanation: The operations are performed as follows: Initially, X = 0. X: X is decremented by 1, X = 0  1 = 1. X++: X is incremented by 1, X = 1 + 1 = 0. X++: X is incremented by 1, X = 0 + 1 = 1.
Example 2:
Input: operations = ["++X","++X","X++"] Output: 3 Explanation: The operations are performed as follows: Initially, X = 0. ++X: X is incremented by 1, X = 0 + 1 = 1. ++X: X is incremented by 1, X = 1 + 1 = 2. X++: X is incremented by 1, X = 2 + 1 = 3.
Example 3:
Input: operations = ["X++","++X","X","X"] Output: 0 Explanation: The operations are performed as follows: Initially, X = 0. X++: X is incremented by 1, X = 0 + 1 = 1. ++X: X is incremented by 1, X = 1 + 1 = 2. X: X is decremented by 1, X = 2  1 = 1. X: X is decremented by 1, X = 1  1 = 0.
Constraints:
1 <= operations.length <= 100
operations[i]
will be either"++X"
,"X++"
,"X"
, or"X"
.
Solutions
Solution 1: Simulation
Traverse the array operations
. For each operation $operations[i]$, if it contains '+'
, then the answer increases by $1$, otherwise the answer decreases by $1$.
The time complexity is $O(n)$, where $n$ is the length of the array operations
. The space complexity is $O(1)$.
Python Code


Java Code


C++ Code


Go Code


TypeScript Code


Rust Code


JavaScript Code


C Code


Solution 2
TypeScript Code

