replace the solution of problem 66 and set the difficulty
This commit is contained in:
parent
0d8a4a025b
commit
8527c7c83c
@ -989,7 +989,7 @@
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★★)"
|
||||
"#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★☆)"
|
||||
]
|
||||
},
|
||||
{
|
||||
|
@ -178,7 +178,7 @@ np.sqrt(-1) == np.emath.sqrt(-1)
|
||||
|
||||
#### 65. How to accumulate elements of a vector (X) to an array (F) based on an index list (I)? (★★★)
|
||||
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★★)
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★☆)
|
||||
|
||||
#### 67. Considering a four dimensions array, how to get sum over the last two axis at once? (★★★)
|
||||
|
||||
|
@ -178,7 +178,7 @@ np.sqrt(-1) == np.emath.sqrt(-1)
|
||||
`hint: np.bincount | np.add.at`
|
||||
#### 65. How to accumulate elements of a vector (X) to an array (F) based on an index list (I)? (★★★)
|
||||
`hint: np.bincount`
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★★)
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★☆)
|
||||
`hint: np.unique`
|
||||
#### 67. Considering a four dimensions array, how to get sum over the last two axis at once? (★★★)
|
||||
`hint: sum(axis=(-2,-1))`
|
||||
|
@ -674,21 +674,11 @@ I = [1,3,9,3,4,1]
|
||||
F = np.bincount(I,X)
|
||||
print(F)
|
||||
```
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★★)
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★☆)
|
||||
`hint: np.unique`
|
||||
|
||||
```python
|
||||
# Author: Nadav Horesh
|
||||
|
||||
w,h = 16,16
|
||||
I = np.random.randint(0,2,(h,w,3)).astype(np.ubyte)
|
||||
# The parenthesis around 256*256 ensure the dtpye promoted to uint32 properly.Otherwise the first term will overflow.
|
||||
F = I[...,0]*(256*256) + I[...,1]*256 +I[...,2]
|
||||
n = len(np.unique(F))
|
||||
print(np.unique(I))
|
||||
|
||||
# Another solution
|
||||
# Author: Fisher Wangg
|
||||
# Author: Fisher Wang
|
||||
|
||||
w, h = 16, 16
|
||||
img = np.random.randint(0, 256, (w, h, 3)).astype(np.ubyte)
|
||||
|
@ -674,20 +674,10 @@ I = [1,3,9,3,4,1]
|
||||
F = np.bincount(I,X)
|
||||
print(F)
|
||||
```
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★★)
|
||||
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★☆)
|
||||
|
||||
|
||||
```python
|
||||
# Author: Nadav Horesh
|
||||
|
||||
w,h = 16,16
|
||||
I = np.random.randint(0,2,(h,w,3)).astype(np.ubyte)
|
||||
# The parenthesis around 256*256 ensure the dtpye promoted to uint32 properly.Otherwise the first term will overflow.
|
||||
F = I[...,0]*(256*256) + I[...,1]*256 +I[...,2]
|
||||
n = len(np.unique(F))
|
||||
print(np.unique(I))
|
||||
|
||||
# Another solution
|
||||
# Author: Fisher Wang
|
||||
|
||||
w, h = 16, 16
|
||||
|
@ -855,22 +855,12 @@ F = np.bincount(I,X)
|
||||
print(F)
|
||||
|
||||
< q66
|
||||
Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★★)
|
||||
Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique colors (★★☆)
|
||||
|
||||
< h66
|
||||
hint: np.unique
|
||||
|
||||
< a66
|
||||
# Author: Nadav Horesh
|
||||
|
||||
w,h = 16,16
|
||||
I = np.random.randint(0,2,(h,w,3)).astype(np.ubyte)
|
||||
# The parenthesis around 256*256 ensure the dtpye promoted to uint32 properly.Otherwise the first term will overflow.
|
||||
F = I[...,0]*(256*256) + I[...,1]*256 +I[...,2]
|
||||
n = len(np.unique(F))
|
||||
print(np.unique(I))
|
||||
|
||||
# Another solution
|
||||
# Author: Fisher Wang
|
||||
|
||||
w, h = 16, 16
|
||||
|
Loading…
Reference in New Issue
Block a user