You are given an integer array daysLate where daysLate[i] indicates how many days late the ith book was returned.
The penalty is calculated as follows:
daysLate[i] == 1, penalty is 1.2 <= daysLate[i] <= 5, penalty is 2 * daysLate[i].daysLate[i] > 5, penalty is 3 * daysLate[i].Return the total penalty for all books.
Example 1:
Input: daysLate = [5,1,7]
Output: 32
Explanation:
daysLate[0] = 5: Penalty is 2 * daysLate[0] = 2 * 5 = 10.daysLate[1] = 1: Penalty is 1.daysLate[2] = 7: Penalty is 3 * daysLate[2] = 3 * 7 = 21.10 + 1 + 21 = 32.Example 2:
Input: daysLate = [1,1]
Output: 2
Explanation:
daysLate[0] = 1: Penalty is 1.daysLate[1] = 1: Penalty is 1.1 + 1 = 2.
Constraints:
1 <= daysLate.length <= 1001 <= daysLate[i] <= 100We define a function f(x) to calculate the late fee for each book:
$
f(x) = \begin{cases}
1 & x = 1 \
2x & 2 leq x leq 5 \
3x & x > 5
\end{cases}
Then, for each element x in the array daysLate, we compute f(x) and sum them up to get the total late fee.
The time complexity is O(n), where n is the length of the array daysLate. The space complexity is O(1)$.
Java
C++
Go
TypeScript
Practice Library Late Fee Calculator with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor