समस्या
Each move removes two coins from one pile and one coin from the other. Either orientation is allowed. You may never remove more coins than remain. Determine whether both piles can end at zero.
Implement coin_piles(left, right).
Input
left: The number of coins in the left pile.
right: The number of coins in the right pile.
Output
Return true if the piles can both be emptied; otherwise return false.
सीमाएँ
0 ≤ left, right ≤ 1,000,000,000. Two empty piles are already a successful result.
उदाहरण
इनपुट:
left = 4
right = 2
अपेक्षित आउटपुट:
expected = Trueइनपुट:
long long left = 4;
long long right = 2;
अपेक्षित आउटपुट:
bool expected = true;इनपुट:
long left = 4;
long right = 2;
अपेक्षित आउटपुट:
bool expected = true;व्याख्या
Remove (2, 1) twice: (4, 2) → (2, 1) → (0, 0).
इनपुट:
left = 4
right = 1
अपेक्षित आउटपुट:
expected = Falseइनपुट:
long long left = 4;
long long right = 1;
अपेक्षित आउटपुट:
bool expected = false;इनपुट:
long left = 4;
long right = 1;
अपेक्षित आउटपुट:
bool expected = false;व्याख्या
The only possible first move leaves (2, 0), after which no move can empty the left pile.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Each move removes exactly three coins total, so the overall coin count must fit that pattern.
संकेत 2
Neither pile can be reduced below zero, so one pile cannot exceed what the other can support.
संकेत 3
Check both the total amount and the difference between piles.
अपेक्षित जटिलता
O(1) time, O(1) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।