Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 651 with 30 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 651 # by problem number
lcpy gen -s four_keys_keyboard # by problem name
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.n, return the maximum number of 'A' you can print on the screen with at most n presses on the keys.
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
Input: n = 7
Output: 9
Explanation: We can at most get 9 A's on screen by pressing the following key sequence: A, A, A, Ctrl A, Ctrl C, Ctrl V, Ctrl V
1 <= n <= 50class Solution:
# Time: O(n^2)
# Space: O(n)
def max_a(self, n: int) -> int:
dp = list(range(n + 1))
for i in range(3, n + 1):
for j in range(2, i - 1):
dp[i] = max(dp[i], dp[j - 1] * (i - j))
return dp[n]
| Time | Space |
|---|---|
| O(n^2) | O(n) |