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 1716 with 31 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1716 # by problem number
lcpy gen -s calculate_money_in_leetcode_bank # by problem name
$1 on Monday, the first day. Every day from Tuesday to Sunday, he will put in $1 more than the day before. On every subsequent Monday, he will put in $1 more than the previous Monday.
Given n, return the total amount of money he will have in the Leetcode bank at the end of the n^th day.
Input: n = 4
Output: 10
Explanation: After the 4th day, the total is 1 + 2 + 3 + 4 = 10.
Input: n = 10
Output: 37
Explanation: After the 10th day, the total is (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4) = 37. Notice that on the 2nd Monday, Hercy only puts in $2.
Input: n = 20
Output: 96
Explanation: After the 20th day, the total is (1 + 2 + 3 + 4 + 5 + 6 + 7) + (2 + 3 + 4 + 5 + 6 + 7 + 8) + (3 + 4 + 5 + 6 + 7 + 8) = 96.
class Solution:
# Time: O(1)
# Space: O(1)
def total_money(self, n: int) -> int:
full_weeks, rem = divmod(n, 7)
weeks_total = full_weeks * 28 + 7 * full_weeks * (full_weeks - 1) // 2
rem_total = rem * (full_weeks + 1) + rem * (rem - 1) // 2
return weeks_total + rem_total
| Time | Space |
|---|---|
| O(1) | O(1) |