समस्या
You may select any subset of the supplied coins. Each individual coin may be used at most once, even when multiple coins share a value. Find the smallest positive integer amount that no selection can produce.
Implement missing_coin_sum(coins).
Input
coins: The values of the available coins; duplicates represent separate coins.
Output
Return the smallest positive impossible amount.
सीमाएँ
1 ≤ number of coins ≤ 200,000. Each value is between 1 and 1,000,000,000.
उदाहरण
इनपुट:
coins = [1, 1, 4]
अपेक्षित आउटपुट:
expected = 3इनपुट:
std::vector<long long> coins = {1, 1, 4};
अपेक्षित आउटपुट:
long long expected = 3;इनपुट:
long[] coins = new long[] {1, 1, 4};
अपेक्षित आउटपुट:
long expected = 3;व्याख्या
Amounts 1 and 2 use the one-valued coins. No available subset totals 3.
इनपुट:
coins = [2, 3]
अपेक्षित आउटपुट:
expected = 1इनपुट:
std::vector<long long> coins = {2, 3};
अपेक्षित आउटपुट:
long long expected = 1;इनपुट:
long[] coins = new long[] {2, 3};
अपेक्षित आउटपुट:
long expected = 1;व्याख्या
There is no way to make 1 because every coin is worth at least 2.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Sort the coins and build the smallest reachable sum from smallest upward.
संकेत 2
If the next coin is larger than the first unreachable amount, that amount can never be formed.
संकेत 3
Duplicates help only when they extend the currently reachable range without gaps.
अपेक्षित जटिलता
O(n log n) time, O(1) extra space, excluding sorting implementation details
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।