Postage drawer: Positive-ink invoice
Inputs
readings is a list of integers (numbers with no decimal part). It may be empty, and numbers may repeat unless task 1 says otherwise.
Your tasks
- Create a list
fewestStamps. Each number inreadingsis an amount of postage. You can use as many stamps of value 1, 4, or 9 as you need. Find the fewest stamps whose values add up to each amount exactly. For amount 8, two stamps of value 4 are enough. Amount 0 needs 0 stamps. Put the answers in input order. - Add only the numbers in
fewestStampsthat are greater than 0. Store the sum inpositiveTotal. - Complete
postageDrawerPositiveInkInvoiceso it returnspositiveTotal. Return it, do not print it.
Example
If readings is [2, 2, 5, 2, 4], then fewestStamps is [2, 2, 2, 2, 1] and postageDrawerPositiveInkInvoice returns 9.
Rules
- Skip zeros.
- If no number is greater than 0, return 0.
Test data
TEST DATA 1: readings is [14, 0, 12, 14, 5].
TEST DATA 2: readings is [9, 8, 9, 9].
Examples
Input: readings = [14,0,12,14,5] Output: 11
fewestStamps is [3, 0, 3, 3, 2]. Keep [3, 3, 3, 2] and add those numbers. Return 11.
Input: readings = [9,8,9,9] Output: 5
fewestStamps is [1, 2, 1, 1]. Keep [1, 2, 1, 1] and add those numbers. Return 5.
Input: readings = [] Output: 0
fewestStamps is []. Keep [] and add those numbers. Return 0.
Input limits
- 0 <= input size <= 64.
- Answers fit in a signed 32-bit integer: -2,147,483,648 through 2,147,483,647.
- Input numbers are whole numbers from 0 through 40.
Efficiency goal
Big-O describes how the work or memory needed grows as the input gets larger.
Efficiency goal: time O(n + M); extra memory, including the helper list, O(n). n is the input length; M is the largest input number. These labels describe how work and memory grow with the input.
Practice focus
Build fewestStamps first, then return exactly what the tasks ask for. Follow the order, keep repeated values when the rule says so, and check the empty case.