Given two integers, num and t. A number is achievable if it can become equal to num after applying the following operation:
1, and simultaneously increase or decrease num by 1.Return the maximum achievable number after applying the operation at most t times.
Example 1:
Input: num = 4, t = 1
Output: 6
Explanation:
Apply the following operation once to make the maximum achievable number equal to num:
num by 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:
num by 1.
Constraints:
1 <= num, t <= 50Solutions for this problem are being prepared.
Try solving it yourselfLeetcode Asked a Dirty Question!! - Maximum 69 Number - Leetcode 1323 • Greg Hogg • 71,069 views views
Watch 9 more video solutions →Practice Find the Maximum Achievable Number with our built-in code editor and test cases.
Practice on FleetCode