给定三个非零整数a,b和c。任务是通过以任意顺序在它们之间添加加法和乘法符号来找到可能的最大值。
请注意,允许重新排列整数,但必须使用一次加法和乘法符号。
如果a = 1,b = 3和c = 5,则最大值将为20,如下所示-
(1 + 3) * 5 = 20
1. If all numbers are positive, then add two small numbers and multiply result with larger one 2. If only two numbers are positive, then multiply 2 positive numbers and add remaining number 3. If only one number is positive, then multiply 2 negative number and add remaining number 4. If all numbers are negative, then add two largest integers and multiply then with remaining number
#include <bits/stdc++.h> using namespace std; int getMaximumResult(int a, int b, int c){ int negativeCnt = 0; int sum = a + b + c; int mul = a * b * c; int largest = max(a, max(b, c)); int smallest = min(a, min(b, c)); if (a < 0) { ++negativeCnt; } if (b < 0) { ++negativeCnt; } if (c < 0) { ++negativeCnt; } if (negativeCnt == 0) { return (sum - largest) * largest; } else if (negativeCnt == 1) { return (mul / smallest) + smallest; } else if (negativeCnt == 2) { return (mul / largest) + largest; } else if (negativeCnt == 3) { return (sum - smallest) * smallest; } } int main(){ int a = 1, b = 3, c = 5; cout << "Maximum value = " << getMaximumResult(a, b, c) << endl; return 0; }
输出结果
当您编译并执行上述程序时。它生成以下输出-
Maximum value = 20