Keep Multiplying Found Values by Two — LeetCode 2154 Python Solution

The problem

You are given an array of integers nums. You are also given an integer original which is the first number that needs to be searched for in nums.

Example

Input

nums = [5,3,6,1,12], original = 3

Output

24

Explanation

- 3 is found in nums. 3 is multiplied by 2 to obtain 6.

Python solution

class Solution:
    def findFinalValue(self, nums: List[int], original: int) -> int:
        s = set(nums)
        while original in s:
            original <<= 1
        return original

Complexity

Pattern: Sorting

Spend O(n log n) once to buy an ordering that makes the rest of the problem trivial. LeetCode 2154. Keep Multiplying Found Values by Two is filed here because LeetCode tags it Sorting, which is the vocabulary this hub collects.

The sorting guide has the Python template for the pattern and the 401 LeetCode problems that use it.

Related problems