daviddoji/numpy-100
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

alternative solution to exercise 87

Browse Source 
Added a more elegant (but more cryptic) solution with reshape and
swapaxes.

Removed one of the existing alternative solutions because it was a
duplicate of a previous alternative solution.
This commit is contained in:
Gattocrucco
2025-08-25 18:13:30 +02:00
parent 9be9c8cd23
commit 59a403da66
3 changed files with 6 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
100_Numpy_exercises_with_hints_with_solutions.md
View File

@@ -1086,11 +1086,8 @@ k = 4
windows = np.lib.stride_tricks.sliding_window_view(Z, (k, k)) windows = np.lib.stride_tricks.sliding_window_view(Z, (k, k))
S = windows[::k, ::k, ...].sum(axis=(-2, -1)) S = windows[::k, ::k, ...].sum(axis=(-2, -1))
# Author: Jeff Luo (@Jeff1999) # alternative solution (by @Gattocrucco)
S = Z.reshape(4, 4, 4, 4).swapaxes(1, 2).sum((2, 3))
Z = np.ones((16, 16))
k = 4
print(sliding_window_view(Z, window_shape=(k, k))[::k, ::k].sum(axis=(-2, -1)))
``` ```
#### 88. How to implement the Game of Life using numpy arrays? (★★★) #### 88. How to implement the Game of Life using numpy arrays? (★★★)
`No hints provided...` `No hints provided...`

7
100_Numpy_exercises_with_solutions.md
View File

@@ -1086,11 +1086,8 @@ k = 4
windows = np.lib.stride_tricks.sliding_window_view(Z, (k, k)) windows = np.lib.stride_tricks.sliding_window_view(Z, (k, k))
S = windows[::k, ::k, ...].sum(axis=(-2, -1)) S = windows[::k, ::k, ...].sum(axis=(-2, -1))
# Author: Jeff Luo (@Jeff1999) # alternative solution (by @Gattocrucco)
S = Z.reshape(4, 4, 4, 4).swapaxes(1, 2).sum((2, 3))
Z = np.ones((16, 16))
k = 4
print(sliding_window_view(Z, window_shape=(k, k))[::k, ::k].sum(axis=(-2, -1)))
``` ```
#### 88. How to implement the Game of Life using numpy arrays? (★★★) #### 88. How to implement the Game of Life using numpy arrays? (★★★)

7
source/exercises100.ktx
View File

@@ -1333,11 +1333,8 @@ k = 4
windows = np.lib.stride_tricks.sliding_window_view(Z, (k, k)) windows = np.lib.stride_tricks.sliding_window_view(Z, (k, k))
S = windows[::k, ::k, ...].sum(axis=(-2, -1)) S = windows[::k, ::k, ...].sum(axis=(-2, -1))
# Author: Jeff Luo (@Jeff1999) # alternative solution (by @Gattocrucco)
S = Z.reshape(4, 4, 4, 4).swapaxes(1, 2).sum((2, 3))
Z = np.ones((16, 16))
k = 4
print(sliding_window_view(Z, window_shape=(k, k))[::k, ::k].sum(axis=(-2, -1)))
< q88 < q88
How to implement the Game of Life using numpy arrays? (★★★) How to implement the Game of Life using numpy arrays? (★★★)