Description
Given two integers, num and t. A number x is achievable if it can become equal to num after applying the following operation at most t times:
- Increase or decrease xby1, and simultaneously increase or decreasenumby1.
Return the maximum possible value of x.
Β
Example 1:
Input: num = 4, t = 1
Output: 6
Explanation:
Apply the following operation once to make the maximum achievable number equal to num:
- Decrease the maximum achievable number by 1, and increase numby 1.
Example 2:
Input: num = 3, t = 2
Output: 7
Explanation:
Apply the following operation twice to make the maximum achievable number equal to num:
- Decrease the maximum achievable number by 1, and increase numby 1.
Β
Constraints:
- 1 <= num, tΒ <= 50
Solution
Python3
class Solution:
    def theMaximumAchievableX(self, num: int, t: int) -> int:
        return num + 2 * t