HTMLify
LeetCode - Find the Maximum Achievable Number - C
Views: 2 | Author: abh
1 2 3 4 5 | // @leet start int theMaximumAchievableX(int num, int t) { return num + t * 2; } // @leet end |
1 2 3 4 5 | // @leet start int theMaximumAchievableX(int num, int t) { return num + t * 2; } // @leet end |