물음표 살인마의 개발블로그

알고리즘 문제/Leetcode

2011. Final Value of Variable After Performing Operations

BEstyle 2023. 4. 2. 19:39

There is a programming language with only four operations and one variable X:

  • ++X and X++ increments the value of the variable X by 1.
  • --X and X-- decrements the value of the variable X by 1.

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--".

class Solution:
    def finalValueAfterOperations(self, operations: List[str]) -> int:
        ans=0
        for o in operations:
            if "-" in o:
                ans-=1
            else:
                ans+=1
        return ans

'알고리즘 문제 > Leetcode' 카테고리의 다른 글

62. Unique Paths  (0) 2023.04.04
1512. Number of Good Pairs  (0) 2023.04.04
2574. Left and Right Sum Differences  (0) 2023.04.02
2469. Convert the Temperature  (0) 2023.04.02
1920. Build Array from Permutation  (0) 2023.04.02