Merge pull request #231 from Emmet-Ray/Emmet-Ray-fixed-typos
fixed typos
This commit is contained in:
@@ -506,7 +506,7 @@ Z = np.arange(10)
|
|||||||
np.add.reduce(Z)
|
np.add.reduce(Z)
|
||||||
|
|
||||||
< q42
|
< q42
|
||||||
Consider two random array A and B, check if they are equal (★★☆)
|
Consider two random arrays A and B, check if they are equal (★★☆)
|
||||||
|
|
||||||
< h42
|
< h42
|
||||||
hint: np.allclose, np.array_equal
|
hint: np.allclose, np.array_equal
|
||||||
@@ -586,7 +586,7 @@ C = 1.0 / np.subtract.outer(X, Y)
|
|||||||
print(np.linalg.det(C))
|
print(np.linalg.det(C))
|
||||||
|
|
||||||
< q48
|
< q48
|
||||||
Print the minimum and maximum representable value for each numpy scalar type (★★☆)
|
Print the minimum and maximum representable values for each numpy scalar type (★★☆)
|
||||||
|
|
||||||
< h48
|
< h48
|
||||||
hint: np.iinfo, np.finfo, eps
|
hint: np.iinfo, np.finfo, eps
|
||||||
@@ -659,7 +659,7 @@ D = scipy.spatial.distance.cdist(Z,Z)
|
|||||||
print(D)
|
print(D)
|
||||||
|
|
||||||
< q53
|
< q53
|
||||||
How to convert a float (32 bits) array into an integer (32 bits) in place?
|
How to convert a float (32 bits) array into an integer (32 bits) array in place?
|
||||||
|
|
||||||
< h53
|
< h53
|
||||||
hint: view and [:] =
|
hint: view and [:] =
|
||||||
@@ -969,7 +969,7 @@ Z0[::nz+1] = Z
|
|||||||
print(Z0)
|
print(Z0)
|
||||||
|
|
||||||
< q71
|
< q71
|
||||||
Consider an array of dimension (5,5,3), how to mulitply it by an array with dimensions (5,5)? (★★★)
|
Consider an array of dimension (5,5,3), how to multiply it by an array with dimensions (5,5)? (★★★)
|
||||||
|
|
||||||
< h71
|
< h71
|
||||||
hint: array[:, :, None]
|
hint: array[:, :, None]
|
||||||
@@ -1145,7 +1145,7 @@ def distance_points_to_lines(p: np.ndarray, p_1: np.ndarray, p_2: np.ndarray) ->
|
|||||||
distance_points_to_lines(p, P0, P1)
|
distance_points_to_lines(p, P0, P1)
|
||||||
|
|
||||||
< q80
|
< q80
|
||||||
Consider an arbitrary array, write a function that extract a subpart with a fixed shape and centered on a given element (pad with a `fill` value when necessary) (★★★)
|
Consider an arbitrary array, write a function that extracts a subpart with a fixed shape and centered on a given element (pad with a `fill` value when necessary) (★★★)
|
||||||
|
|
||||||
< h80
|
< h80
|
||||||
hint: minimum maximum
|
hint: minimum maximum
|
||||||
@@ -1366,7 +1366,7 @@ print (Z[np.argsort(Z)[-n:]])
|
|||||||
print (Z[np.argpartition(-Z,n)[:n]])
|
print (Z[np.argpartition(-Z,n)[:n]])
|
||||||
|
|
||||||
< q90
|
< q90
|
||||||
Given an arbitrary number of vectors, build the cartesian product (every combinations of every item) (★★★)
|
Given an arbitrary number of vectors, build the cartesian product (every combination of every item) (★★★)
|
||||||
|
|
||||||
< h90
|
< h90
|
||||||
hint: np.indices
|
hint: np.indices
|
||||||
|
|||||||
Reference in New Issue
Block a user