ID | Title | Difficulty | |
---|---|---|---|
Loading... |
651. 4 Keys Keyboard
Medium
LeetCode
Math, Dynamic Programming
Problem
Imagine you have a special keyboard with the following keys:
- A: Print one ‘A’ on the screen.
- Ctrl-A: Select the whole screen.
- Ctrl-C: Copy selection to buffer.
- Ctrl-V: Print buffer on screen appending it after what has already been printed.
Given an integer n, return the maximum number of ‘A’ you can print on the screen with at most n presses on the keys.
Example 1:
Input: n = 3
Output: 3
Explanation: We can at most get 3 A's on screen by pressing the following key sequence:
A, A, A
Example 2:
Input: n = 7
Output: 9
Explanation: We can at most get 9 A's on screen by pressing following key sequence:
A, A, A, Ctrl A, Ctrl C, Ctrl V, Ctrl V
Constraints:
- 1 <= n <= 50
Code
class Solution {
public int maxA(int n) {
int[] dp = new int[n + 1];
for (int i = 1; i <= n; i++) {
dp[i] = i;
for (int j = 1; j < i - 2; j++) {
// 全选复制粘贴
int total = dp[j] + (i - j - 2) * dp[j];
dp[i] = Math.max(dp[i], total);
}
}
return dp[n];
}
}
按 <- 键看上一题!
650. 2 Keys Keyboard
按 -> 键看下一题!
652. Find Duplicate Subtrees