LeetCode Records - Question 2769 Find the Maximum Achievable Number
class Solution {
public int theMaximumAchievableX(int num, int t) {
return num + t * 2;
}
}- Runtime: 1 ms (Beats: 100.00%)
- Memory: 41.09 MB (Beats: 85.99%)
class Solution {
public int theMaximumAchievableX(int num, int t) {
return num + t * 2;
}
}