Daily question - force deduction - multiply the found value by 2

The title comes from Li Kou ——2154. Multiply the found value by 2 - Power button （LeetCode） (leetcode-cn.com)

 

Give you an array of integers nums , I'll give you another integer original , This is needed in nums The first number in the search .

Next , You need to follow the steps below ：

If in nums Find original , take original  multiply 2 , Get new original（ namely , Make original = 2 * original）.
otherwise , Stop this process .
As long as you can find new in the array original , Right new original continue repeat This process .
return original Of Final value .

Example 1：

Input ：nums = [5,3,6,1,12], original = 3
Output ：24
explain ： 
- 3 Can be in nums Find .3 * 2 = 6 .
- 6 Can be in nums Find .6 * 2 = 12 .
- 12 Can be in nums Find .12 * 2 = 24 .
- 24 Can't be in nums Find . therefore , return 24 .
Example 2：

Input ：nums = [2,7,9], original = 4
Output ：4
explain ：
- 4 Can't be in nums Find . therefore , return 4 .

int findFinalValue(int* nums, int numsSize, int original){
    int i = 0;
    int j = 0;
   for(j=0;j<numsSize;j++)
   {
        for(i=0;i<numsSize;i++)
    {
        if(nums[i] == original)
        {
            original*=2;
        }
    }
   }
    return original;
}