-
-
Notifications
You must be signed in to change notification settings - Fork 58
West Midlands | 26-SDC-Mar | Chioma Okeke | Sprint 2 | Improve code with caches #198
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Changes from 2 commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,4 +1,10 @@ | ||
| def fibonacci(n): | ||
| def fibonacci(n, cache={}): | ||
| if n in cache: | ||
| return cache[n] | ||
|
|
||
| if n <= 1: | ||
| return n | ||
| return fibonacci(n - 1) + fibonacci(n - 2) | ||
|
|
||
| result = fibonacci(n - 1) + fibonacci(n - 2) | ||
| cache[n] = result | ||
| return result |
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,32 +1,35 @@ | ||
| from typing import List | ||
|
|
||
|
|
||
| def ways_to_make_change(total: int) -> int: | ||
| """ | ||
| Given access to coins with the values 1, 2, 5, 10, 20, 50, 100, 200, returns a count of all of the ways to make the passed total value. | ||
|
|
||
| For instance, there are two ways to make a value of 3: with 3x 1 coins, or with 1x 1 coin and 1x 2 coin. | ||
| """ | ||
| return ways_to_make_change_helper(total, [200, 100, 50, 20, 10, 5, 2, 1]) | ||
| return ways_to_make_change_helper(total, 0) | ||
|
|
||
|
|
||
| def ways_to_make_change_helper(total: int, coins: List[int]) -> int: | ||
| def ways_to_make_change_helper(total: int, coin_index: int, cache={}) -> int: | ||
| """ | ||
| Helper function for ways_to_make_change to avoid exposing the coins parameter to callers. | ||
| """ | ||
| if total == 0 or len(coins) == 0: | ||
| coins = (200, 100, 50, 20, 10, 5, 2, 1) | ||
|
|
||
| key = (total, coin_index) | ||
|
|
||
| if key in cache: | ||
| return cache[key] | ||
|
|
||
| if total == 0: | ||
| return 1 | ||
|
|
||
| if coin_index == len(coins): | ||
| return 0 | ||
|
|
||
| ways = 0 | ||
| for coin_index in range(len(coins)): | ||
| coin = coins[coin_index] | ||
| count_of_coin = 1 | ||
| while coin * count_of_coin <= total: | ||
| total_from_coins = coin * count_of_coin | ||
| if total_from_coins == total: | ||
| ways += 1 | ||
| else: | ||
| intermediate = ways_to_make_change_helper(total - total_from_coins, coins=coins[coin_index+1:]) | ||
| ways += intermediate | ||
| count_of_coin += 1 | ||
| coin = coins[coin_index] | ||
|
|
||
| if coin > total: | ||
| ways = ways_to_make_change_helper(total, coin_index + 1) | ||
| else: | ||
| ways = (ways_to_make_change_helper(total - coin, coin_index) + ways_to_make_change_helper(total, coin_index + 1)) | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. It seems the code on lines 30-32 could be shorten.
Author
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. The if/else structure, once flattened, breaks the flow for large inputs like the There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. One of the function calls will always happen. That would suggest it does not need to reside in an if-else block. |
||
|
|
||
| cache[key] = ways | ||
| return ways | ||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Declaring
coinas a local variable means a different tuple (with identical items) is created in every recursive function call.Why not pass the coin list through the parameter so that the function can be reused for different coin list?
When we pass a list to a function, we are only passing its reference -- the cost is negligible.
However, if the function is expected to accept different coin lists, it would not be appropriate to declare the cache as a parameter with a default value.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I have refactored and made
COINSa global variableThere was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Why not pass the coin list through the parameter?