# 如果我們在數組中每次成功搜索后加倍，則找到最終值 > 原文： [https://www.geeksforgeeks.org/find-final-value-if-we-double-after-every-successful-search-in-array/](https://www.geeksforgeeks.org/find-final-value-if-we-double-after-every-successful-search-in-array/) 給定一個數組和一個整數 k，遍歷該數組，如果數組中的元素為 k，則將 k 的值加倍并繼續遍歷。 最后返回 k 值。 例子： ``` Input : arr[] = { 2, 3, 4, 10, 8, 1 }, k = 2 Output :16 First k = 2 is found, then we search for 4 which is also found, then we search for 8 which is also found, then we search for 16. Input : arr[] = { 2, 4, 5, 6, 7 }, k = 3 Output :3 ``` 1-如果 arr [i] == k 則遍歷數組的每個元素，然后 k = 2 * k 2-重復相同的過程直到數組的最后一個元素 3-最后返回 k 的值 HTG2] ## C++ ```cpp // CPP program to find value if we double? // the value after every successful search #include <bits/stdc++.h> using namespace std; // Function to Find the value of k int findValue(int arr[], int n, int k) { ??// Search for k. After every successful ??// search, double k. ??for (int i = 0; i < n; i++)? ????if (arr[i] == k) ??????k *= 2; ??return k; } // Driver's Code int main() { ??int arr[] = {2, 3, 4, 10, 8, 1}, k = 2; ??int n = sizeof(arr) / sizeof(arr[0]); ??cout << findValue(arr, n, k); ??return 0; } ```