100道練習(xí)帶你玩轉(zhuǎn)Numpy

Numpy是用Python做數(shù)據(jù)分析所必須要掌握的基礎(chǔ)庫之一,它可以用來存儲和處理大型矩陣,并且Numpy提供了許多高級的數(shù)值編程工具,如:矩陣數(shù)據(jù)類型、矢量處理,以及精密的運(yùn)算庫,專為進(jìn)行嚴(yán)格的數(shù)字處理而產(chǎn)生。

本文內(nèi)容由科賽網(wǎng)翻譯整理自Github開源項(xiàng)目(部分題目保留了原文作參考),建議讀者完成科賽網(wǎng)?Numpy快速上手指南 --- 基礎(chǔ)篇?和?Numpy快速上手指南 --- 進(jìn)階篇?這兩篇教程的學(xué)習(xí)之后,再對此教程進(jìn)行調(diào)試學(xué)習(xí)。

以下為100道Numpy習(xí)題及答案

1. 導(dǎo)入numpy庫并簡寫為 np

(提示: import … as …)

In [ ]:

# import numpy as np

2. 打印numpy的版本和配置說明

(提示: np.__version__, np.show_config)

In [ ]:

# print(np.__version__)

# np.show_config()

3. 創(chuàng)建一個長度為10的空向量

(提示: np.zeros)

In [ ]:

# Z = np.zeros(10)

# print(Z)

4. 如何找到任何一個數(shù)組的內(nèi)存大小?

(提示: size, itemsize)

In [ ]:

# Z = np.zeros((10,10))

# print("%d bytes" % (Z.size * Z.itemsize))

5. 如何從命令行得到numpy中add函數(shù)的說明文檔?

(提示:?http://np.info)

In [ ]:

#?http://numpy.info(numpy.add)

6. 創(chuàng)建一個長度為10并且除了第五個值為1的空向量

(提示: array[4])

In [ ]:

# Z = np.zeros(10)

# Z[4] = 1

# print(Z)

7. 創(chuàng)建一個值域范圍從10到49的向量

(提示: np.arange)

In [ ]:

# Z = np.arange(10,50)

# print(Z)

8. 反轉(zhuǎn)一個向量(第一個元素變?yōu)樽詈笠粋€)

(提示: array[::-1])

In [ ]:

# Z = np.arange(50)

# Z = Z[::-1]

# print(Z)

9. 創(chuàng)建一個 3x3 并且值從0到8的矩陣

(提示: reshape)

In [ ]:

# Z = np.arange(9).reshape(3,3)

# print(Z)

10. 找到數(shù)組[1,2,0,0,4,0]中非0元素的位置索引

(提示: np.nonzero)

In [ ]:

# nz = np.nonzero([1,2,0,0,4,0])

# print(nz)

11. 創(chuàng)建一個 3x3 的單位矩陣

(提示: np.eye)

In [ ]:

# Z = np.eye(3)

# print(Z)

12. 創(chuàng)建一個 3x3x3的隨機(jī)數(shù)組

(提示: np.random.random)

In [ ]:

# Z = np.random.random((3,3,3))

# print(Z)

13. 創(chuàng)建一個 10x10 的隨機(jī)數(shù)組并找到它的最大值和最小值

(提示: min, max)

In [ ]:

# Z = np.random.random((10,10))

# Zmin, Zmax = Z.min(), Z.max()

# print(Zmin, Zmax)

14. 創(chuàng)建一個長度為30的隨機(jī)向量并找到它的平均值

(提示: mean)

In [ ]:

# Z = np.random.random(30)

# m = Z.mean()

# print(m)

15.創(chuàng)建一二維數(shù)組,其中邊界值為1,其余值為0

(提示: array[1:-1, 1:-1])

In [ ]:

# Z = np.ones((10,10))

# Z[1:-1,1:-1] = 0

# print(Z)

16. 對于一個存在在數(shù)組,如何添加一個用0填充的邊界?

(提示: np.pad)

In [ ]:

# Z = np.ones((5,5))

# Z = np.pad(Z, pad_width=1, mode='constant', constant_values=0)

# print(Z)

17. 以下表達(dá)式運(yùn)行的結(jié)果分別是什么?

(提示: NaN = not a number, inf = infinity)

0*np.nan

np.nan==np.nan

np.inf>np.nan

np.nan-np.nan

0.3==3*0.1

In [ ]:

# print(0 * np.nan)

In [ ]:

# print(np.nan == np.nan)

In [ ]:

# print(np.inf > np.nan)

In [ ]:

# print(np.nan - np.nan)

In [ ]:

# print(0.3 == 3 * 0.1)

18. 創(chuàng)建一個 5x5的矩陣,并設(shè)置值1,2,3,4落在其對角線下方位置

(提示: np.diag)

In [ ]:

# Z = np.diag(1+np.arange(4),k=-1)

# print(Z)

19. 創(chuàng)建一個8x8 的矩陣,并且設(shè)置成棋盤樣式

(提示: array[::2])

In [ ]:

# Z = np.zeros((8,8),dtype=int)

#Z[1::2,::2] = 1

# Z[::2,1::2] = 1

# print(Z)

20. 考慮一個 (6,7,8) 形狀的數(shù)組,其第100個元素的索引(x,y,z)是什么?

(提示: np.unravel_index)

In [ ]:

# print(np.unravel_index(100,(6,7,8)))

21. 用tile函數(shù)去創(chuàng)建一個 8x8的棋盤樣式矩陣

(提示: np.tile)

In [ ]:

# Z = np.tile( np.array([[0,1],[1,0]]), (4,4))

# print(Z)

22. 對一個5x5的隨機(jī)矩陣做歸一化

(提示: (x - min) / (max - min))

In [ ]:

# Z = np.random.random((5,5))

# Zmax, Zmin = Z.max(), Z.min()

# Z = (Z - Zmin)/(Zmax - Zmin)

# print(Z)

23. 創(chuàng)建一個將顏色描述為(RGBA)四個無符號字節(jié)的自定義dtype?

(提示: np.dtype)

In [ ]:

# color = np.dtype([("r", np.ubyte, 1),

# ("g", np.ubyte, 1),

# ("b", np.ubyte, 1),

# ("a", np.ubyte, 1)])

# color

24. 一個5x3的矩陣與一個3x2的矩陣相乘,實(shí)矩陣乘積是什么?

(提示: np.dot | @)

In [ ]:

# Z = np.dot(np.ones((5,3)), np.ones((3,2)))

# print(Z)

25. 給定一個一維數(shù)組,對其在3到8之間的所有元素取反

(提示: >, <=)

In [ ]:

# Z = np.arange(11)

# Z[(3 < Z) & (Z <= 8)] *= -1

# print(Z)

26. 下面腳本運(yùn)行后的結(jié)果是什么?

(提示: np.sum)

In [ ]:

# print(sum(range(5),-1))

In [ ]:

# from numpy import *

# print(sum(range(5),-1))

27. 考慮一個整數(shù)向量Z,下列表達(dá)合法的是哪個?

Z**Z

2<<Z>>2

Z<-Z

1j*Z

Z/1/1

Z<Z>Z

In [ ]:

# Z = np.arange(5)

# Z ** Z # legal

In [ ]:

# Z = np.arange(5)

# 2 << Z >> 2 # false

In [ ]:

# Z = np.arange(5)

# Z <- Z # legal

In [ ]:

# Z = np.arange(5)

# 1j*Z # legal

In [ ]:

# Z = np.arange(5)

# Z/1/1 # legal

In [ ]:

# Z = np.arange(5)

# Z<Z>Z # false

28. 下列表達(dá)式的結(jié)果分別是什么?

np.array(0) /np.array(0)

np.array(0) //np.array(0)

np.array([np.nan]).astype(int).astype(float)

In [ ]:

# print(np.array(0) / np.array(0))

In [ ]:

# print(np.array(0) // np.array(0))

In [ ]:

# print(np.array([np.nan]).astype(int).astype(float))

29. 如何從零位對浮點(diǎn)數(shù)組做舍入 ?

(提示: np.uniform, np.copysign, np.ceil, np.abs)

In [ ]:

# Z = np.random.uniform(-10,+10,10)

# print (np.copysign(np.ceil(np.abs(Z)), Z))

30. 如何找到兩個數(shù)組中的共同元素?

(提示: np.intersect1d)

In [ ]:

# Z1 = np.random.randint(0,10,10)

# Z2 = np.random.randint(0,10,10)

# print(np.intersect1d(Z1,Z2))

31. 如何忽略所有的 numpy 警告(盡管不建議這么做)?

(提示: np.seterr, np.errstate)

# Suicide mode on

defaults=np.seterr(all="ignore")

Z=np.ones(1) /0

# Back to sanity

_=np.seterr(**defaults)

Anequivalentway,?withacontextmanager:

withnp.errstate(divide='ignore'):

Z=np.ones(1) /0

32. 下面的表達(dá)式是正確的嗎?

(提示: imaginary number)

np.sqrt(-1) ==np.emath.sqrt(-1)

In [ ]:

# np.sqrt(-1) == np.emath.sqrt(-1) # False

33. 如何得到昨天,今天,明天的日期?

(提示: np.datetime64, np.timedelta64)

In [ ]:

# yesterday = np.datetime64('today', 'D') - np.timedelta64(1, 'D')

# today = np.datetime64('today', 'D')

# tomorrow = np.datetime64('today', 'D') + np.timedelta64(1, 'D')

# print ("Yesterday is " + str(yesterday))

# print ("Today is " + str(today))

# print ("Tomorrow is "+ str(tomorrow))

34. 如何得到所有與2016年7月對應(yīng)的日期?

(提示: np.arange(dtype=datetime64['D']))

In [ ]:

# Z = np.arange('2016-07', '2016-08', dtype='datetime64[D]')

# print(Z)

35. 如何直接在位計算(A+B)\*(-A/2)(不建立副本)?

(提示: np.add(out=), np.negative(out=), np.multiply(out=), np.divide(out=))

In [ ]:

# A = np.ones(3)*1

# B = np.ones(3)*2

# C = np.ones(3)*3

# np.add(A,B,out=B)

In [ ]:

# np.divide(A,2,out=A)

In [ ]:

# np.negative(A,out=A)

In [ ]:

# np.multiply(A,B,out=A)

36. 用五種不同的方法去提取一個隨機(jī)數(shù)組的整數(shù)部分

(提示: %, np.floor, np.ceil, astype, np.trunc)

In [ ]:

# Z = np.random.uniform(0,10,10)

# print (Z - Z%1)

In [ ]:

# print (np.floor(Z))

In [ ]:

# print (np.ceil(Z)-1)

In [ ]:

# print (Z.astype(int))

In [ ]:

# print (np.trunc(Z))

37. 創(chuàng)建一個5x5的矩陣,其中每行的數(shù)值范圍從0到4

(提示: np.arange)

In [ ]:

# Z = np.zeros((5,5))

# Z += np.arange(5)

# print (Z)

38. 通過考慮一個可生成10個整數(shù)的函數(shù),來構(gòu)建一個數(shù)組

(提示: np.fromiter)

In [ ]:

# def generate():

# for x in range(10):

# yield x

# Z = np.fromiter(generate(),dtype=float,count=-1)

# print (Z)

39. 創(chuàng)建一個長度為10的隨機(jī)向量,其值域范圍從0到1,但是不包括0和1

(提示: np.linspace)

In [ ]:

# Z = np.linspace(0,1,11,endpoint=False)[1:]

# print (Z)

40. 創(chuàng)建一個長度為10的隨機(jī)向量,并將其排序

(提示: sort)

In [ ]:

# Z = np.random.random(10)

# Z.sort()

# print (Z)

41.對于一個小數(shù)組,如何用比 np.sum更快的方式對其求和?

(提示: np.add.reduce)

In [ ]:

# Z = np.arange(10)

# np.add.reduce(Z)

42. 對于兩個隨機(jī)數(shù)組A和B,檢查它們是否相等

(提示: np.allclose, np.array_equal)

In [ ]:

# A = np.random.randint(0,2,5)

# B = np.random.randint(0,2,5)

# # Assuming identical shape of the arrays and a tolerance for the comparison of values

# equal = np.allclose(A,B)

# print(equal)

In [ ]:

# # 方法2

# # Checking both the shape and the element values, no tolerance (values have to be exactly equal)

# equal = np.array_equal(A,B)

# print(equal)

43. 創(chuàng)建一個只讀數(shù)組(read-only)

(提示: flags.writeable)

# 使用如下過程實(shí)現(xiàn)

Z=np.zeros(10)

Z.flags.writeable=False

Z[0] =1

---------------------------------------------------------------------------

ValueErrorTraceback(mostrecentcalllast)

in()

1Z=np.zeros(10)

2Z.flags.writeable=False

---->3Z[0] =1

ValueError: assignmentdestinationisread-only

44. 將笛卡爾坐標(biāo)下的一個10x2的矩陣轉(zhuǎn)換為極坐標(biāo)形式

(hint: np.sqrt, np.arctan2)

In [ ]:

# Z = np.random.random((10,2))

# X,Y = Z[:,0], Z[:,1]

# R = np.sqrt(X**2+Y**2)

# T = np.arctan2(Y,X)

# print (R)

# print (T)

45. 創(chuàng)建一個長度為10的向量,并將向量中最大值替換為1

(提示: argmax)

In [ ]:

# Z = np.random.random(10)

# Z[Z.argmax()] = 0

# print (Z)

46. 創(chuàng)建一個結(jié)構(gòu)化數(shù)組,并實(shí)現(xiàn) x 和 y 坐標(biāo)覆蓋 [0,1]x[0,1] 區(qū)域

(提示: np.meshgrid)

In [ ]:

# Z = np.zeros((5,5), [('x',float),('y',float)])

# Z['x'], Z['y'] = np.meshgrid(np.linspace(0,1,5),

# np.linspace(0,1,5))

# print(Z)

47. 給定兩個數(shù)組X和Y,構(gòu)造Cauchy矩陣C (Cij =1/(xi - yj))

(提示: np.subtract.outer)

In [ ]:

# X = np.arange(8)

# Y = X + 0.5

# C = 1.0 / np.subtract.outer(X, Y)

# print(np.linalg.det(C))

48. 打印每個numpy標(biāo)量類型的最小值和最大值?

(提示: np.iinfo, np.finfo, eps)

In [ ]:

# for dtype in [np.int8, np.int32, np.int64]:

# print(np.iinfo(dtype).min)

# print(np.iinfo(dtype).max)

# for dtype in [np.float32, np.float64]:

# print(np.finfo(dtype).min)

# print(np.finfo(dtype).max)

# print(np.finfo(dtype).eps)

49. 如何打印一個數(shù)組中的所有數(shù)值?

(提示: np.set_printoptions)

In [ ]:

# np.set_printoptions(threshold=np.nan)

# Z = np.zeros((16,16))

# print (Z)

50. 給定標(biāo)量時,如何找到數(shù)組中最接近標(biāo)量的值?

(提示: argmin)

In [ ]:

# Z = np.arange(100)

# v = np.random.uniform(0,100)

# index = (np.abs(Z-v)).argmin()

# print (Z[index])

51. 創(chuàng)建一個表示位置(x,y)和顏色(r,g,b)的結(jié)構(gòu)化數(shù)組

(提示: dtype)

In [ ]:

# Z = np.zeros(10, [ ('position', [ ('x', float, 1),

# ('y', float, 1)]),

# ('color', [ ('r', float, 1),

# ('g', float, 1),

# ('b', float, 1)])])

# print (Z)

52. 對一個表示坐標(biāo)形狀為(100,2)的隨機(jī)向量,找到點(diǎn)與點(diǎn)的距離

(提示: np.atleast_2d, T, np.sqrt)

In [ ]:

# Z = np.random.random((10,2))

# X,Y = np.atleast_2d(Z[:,0], Z[:,1])

# D = np.sqrt( (X-X.T)**2 + (Y-Y.T)**2)

# print (D)

In [ ]:

# # 方法2

# # Much faster with scipy

# import scipy

# # Thanks Gavin Heverly-Coulson (#issue 1)

# import scipy.spatial

# D = scipy.spatial.distance.cdist(Z,Z)

# print (D)

53. 如何將32位的浮點(diǎn)數(shù)(float)轉(zhuǎn)換為對應(yīng)的整數(shù)(integer)?

(提示: astype(copy=False))

In [ ]:

# Z = np.arange(10, dtype=np.int32)

# Z = Z.astype(np.float32, copy=False)

# print (Z)

54. 如何讀取以下文件?

(提示: np.genfromtxt)

1, 2, 3, 4, 5

6, , , 7, 8

, , 9,10,11

參考鏈接

55. 對于numpy數(shù)組,enumerate的等價操作是什么?

(提示: np.ndenumerate, np.ndindex)

In [ ]:

# Z = np.arange(9).reshape(3,3)

# for index, value in np.ndenumerate(Z):

# print (index, value)

# for index in np.ndindex(Z.shape):

# print (index, Z[index])

56. 生成一個通用的二維Gaussian-like數(shù)組

(提示: np.meshgrid, np.exp)

In [ ]:

# X, Y = np.meshgrid(np.linspace(-1,1,10), np.linspace(-1,1,10))

# D = np.sqrt(X*X+Y*Y)

# sigma, mu = 1.0, 0.0

# G = np.exp(-( (D-mu)**2 / ( 2.0 * sigma**2 ) ) )

# print (G)

57. 對一個二維數(shù)組,如何在其內(nèi)部隨機(jī)放置p個元素?

(提示: np.put, np.random.choice)

In [ ]:

# n = 10

# p = 3

# Z = np.zeros((n,n))

# np.put(Z, np.random.choice(range(n*n), p, replace=False),1)

# print (Z)

58. 減去一個矩陣中的每一行的平均值

(提示: mean(axis=,keepdims=))

In [ ]:

# X = np.random.rand(5, 10)

# # Recent versions of numpy

# Y = X - X.mean(axis=1, keepdims=True)

# print(Y)

In [ ]:

# # 方法2

# # Older versions of numpy

# Y = X - X.mean(axis=1).reshape(-1, 1)

# print (Y)

59. 如何通過第n列對一個數(shù)組進(jìn)行排序?

(提示: argsort)

In [ ]:

# Z = np.random.randint(0,10,(3,3))

# print (Z)

# print (Z[Z[:,1].argsort()])

60. 如何檢查一個二維數(shù)組是否有空列?

(提示: any, ~)

In [ ]:

# Z = np.random.randint(0,3,(3,10))

# print ((~Z.any(axis=0)).any())

61. 從數(shù)組中的給定值中找出最近的值

(提示: np.abs, argmin, flat)

In [ ]:

# Z = np.random.uniform(0,1,10)

# z = 0.5

# m = Z.flat[np.abs(Z - z).argmin()]

# print (m)

62. 如何用迭代器(iterator)計算兩個分別具有形狀(1,3)和(3,1)的數(shù)組?

(提示: np.nditer)

In [ ]:

# A = np.arange(3).reshape(3,1)

# B = np.arange(3).reshape(1,3)

# it = np.nditer([A,B,None])

# for x,y,z in it:

# z[...] = x + y

# print (it.operands[2])

63. 創(chuàng)建一個具有name屬性的數(shù)組類

(提示: class方法)

In [ ]:

# class NamedArray(np.ndarray):

# def __new__(cls, array, name="no name"):

# obj = np.asarray(array).view(cls)

# obj.name = name

# return obj

# def __array_finalize__(self, obj):

# if obj is None: return

#?http://self.info?= getattr(obj, 'name', "no name")

# Z = NamedArray(np.arange(10), "range_10")

# print (Z.name)

64. 考慮一個給定的向量,如何對由第二個向量索引的每個元素加1(小心重復(fù)的索引)?

(提示: np.bincount | np.add.at)

In [ ]:

# Z = np.ones(10)

# I = np.random.randint(0,len(Z),20)

# Z += np.bincount(I, minlength=len(Z))

# print(Z)

In [ ]:

# # 方法2

# np.add.at(Z, I, 1)

# print(Z)

65. 根據(jù)索引列表(I),如何將向量(X)的元素累加到數(shù)組(F)?

(提示: np.bincount)

In [ ]:

# X = [1,2,3,4,5,6]

# I = [1,3,9,3,4,1]

# F = np.bincount(I,X)

# print (F)

66. 考慮一個(dtype=ubyte) 的 (w,h,3)圖像,計算其唯一顏色的數(shù)量

(提示: np.unique)

In [ ]:

# w,h = 16,16

# I = np.random.randint(0,2,(h,w,3)).astype(np.ubyte)

# #Note that we should compute 256*256 first.

# #Otherwise numpy will only promote F.dtype to 'uint16' and overfolw will occur

# F = I[...,0]*(256*256) + I[...,1]*256 +I[...,2]

# n = len(np.unique(F))

# print (n)

67. 考慮一個四維數(shù)組,如何一次性計算出最后兩個軸(axis)的和?

(提示: sum(axis=(-2,-1)))

In [ ]:

# A = np.random.randint(0,10,(3,4,3,4))

# # solution by passing a tuple of axes (introduced in numpy 1.7.0)

# sum = A.sum(axis=(-2,-1))

# print (sum)

In [ ]:

# # 方法2

# sum = A.reshape(A.shape[:-2] + (-1,)).sum(axis=-1)

# print (sum)

68. 考慮一個一維向量D,如何使用相同大小的向量S來計算D子集的均值?

(提示: np.bincount)

In [ ]:

# D = np.random.uniform(0,1,100)

# S = np.random.randint(0,10,100)

# D_sums = np.bincount(S, weights=D)

# D_counts = np.bincount(S)

# D_means = D_sums / D_counts

# print (D_means)

In [ ]:

# # 方法2

# import pandas as pd

# print(pd.Series(D).groupby(S).mean())

69. 如何獲得點(diǎn)積 dot prodcut的對角線?

(提示: np.diag)

In [ ]:

# A = np.random.uniform(0,1,(5,5))

# B = np.random.uniform(0,1,(5,5))

# # slow version

# np.diag(np.dot(A, B))

In [ ]:

## 方法2

# # Fast version

# np.sum(A * B.T, axis=1)

In [ ]:

## 方法3

# # Faster version

# np.einsum("ij,ji->i", A, B)

70. 考慮一個向量[1,2,3,4,5],如何建立一個新的向量,在這個新向量中每個值之間有3個連續(xù)的零?

(提示: array[::4])

In [ ]:

# Z = np.array([1,2,3,4,5])

# nz = 3

# Z0 = np.zeros(len(Z) + (len(Z)-1)*(nz))

# Z0[::nz+1] = Z

# print (Z0)

71. 考慮一個維度(5,5,3)的數(shù)組,如何將其與一個(5,5)的數(shù)組相乘?

(提示: array[:, :, None])

In [ ]:

# A = np.ones((5,5,3))

# B = 2*np.ones((5,5))

# print (A * B[:,:,None])

72. 如何對一個數(shù)組中任意兩行做交換?

(提示: array[[]] = array[[]])

In [ ]:

# A = np.arange(25).reshape(5,5)

# A[[0,1]] = A[[1,0]]

# print (A)

73. 考慮一個可以描述10個三角形的triplets,找到可以分割全部三角形的line segment

(提示: repeat, np.roll, np.sort, view, np.unique)

In [ ]:

# faces = np.random.randint(0,100,(10,3))

# F = np.roll(faces.repeat(2,axis=1),-1,axis=1)

# F = F.reshape(len(F)*3,2)

# F = np.sort(F,axis=1)

# G = F.view( dtype=[('p0',F.dtype),('p1',F.dtype)] )

# G = np.unique(G)

# print (G)

74. 給定一個二進(jìn)制的數(shù)組C,如何產(chǎn)生一個數(shù)組A滿足np.bincount(A)==C

(提示: np.repeat)

In [ ]:

# C = np.bincount([1,1,2,3,4,4,6])

# A = np.repeat(np.arange(len(C)), C)

# print (A)

75. 如何通過滑動窗口計算一個數(shù)組的平均數(shù)?

(提示: np.cumsum)

In [ ]:

# def moving_average(a, n=3) :

# ret = np.cumsum(a, dtype=float)

# ret[n:] = ret[n:] - ret[:-n]

# return ret[n - 1:] / n

# Z = np.arange(20)

# print(moving_average(Z, n=3))

76. 考慮一維數(shù)組Z,構(gòu)建一個二維數(shù)組,其第一行是(Z [0],Z [1],Z [2]),每個后續(xù)行移1(最后一行應(yīng)該是( Z [-3],Z [-2],Z [-1])

(提示: from numpy.lib import stride_tricks)

In [ ]:

# from numpy.lib import stride_tricks

# def rolling(a, window):

# shape = (a.size - window + 1, window)

# strides = (a.itemsize, a.itemsize)

# return stride_tricks.as_strided(a, shape=shape, strides=strides)

# Z = rolling(np.arange(10), 3)

# print (Z)

77. 如何對布爾值取反,或者原位(in-place)改變浮點(diǎn)數(shù)的符號(sign)?

(提示: np.logical_not, np.negative)

In [ ]:

# Z = np.random.randint(0,2,100)

# np.logical_not(Z, out=Z)

In [ ]:

# Z = np.random.uniform(-1.0,1.0,100)

# np.negative(Z, out=Z)

78. 考慮兩組點(diǎn)集P0和P1去描述一組線(二維)和一個點(diǎn)p,如何計算點(diǎn)p到每一條線 i (P0[i],P1[i])的距離?

In [ ]:

# def distance(P0, P1, p):

# T = P1 - P0

# L = (T**2).sum(axis=1)

# U = -((P0[:,0]-p[...,0])*T[:,0] + (P0[:,1]-p[...,1])*T[:,1]) / L

# U = U.reshape(len(U),1)

# D = P0 + U*T - p

# return np.sqrt((D**2).sum(axis=1))

# P0 = np.random.uniform(-10,10,(10,2))

# P1 = np.random.uniform(-10,10,(10,2))

# p = np.random.uniform(-10,10,( 1,2))

# print (distance(P0, P1, p))

79.考慮兩組點(diǎn)集P0和P1去描述一組線(二維)和一組點(diǎn)集P,如何計算每一個點(diǎn) j(P[j]) 到每一條線 i (P0[i],P1[i])的距離?

In [ ]:

# # based on distance function from previous question

# P0 = np.random.uniform(-10, 10, (10,2))

# P1 = np.random.uniform(-10,10,(10,2))

# p = np.random.uniform(-10, 10, (10,2))

# print (np.array([distance(P0,P1,p_i) for p_i in p]))

80.考慮一個任意數(shù)組,寫一個函數(shù),提取一個固定形狀的子部分,并以給定元素為中心(fill必要時填充一個值)

(提示: minimum, maximum)

In [ ]:

# Z = np.random.randint(0,10,(10,10))

# shape = (5,5)

# fill = 0

# position = (1,1)

# R = np.ones(shape, dtype=Z.dtype)*fill

# P = np.array(list(position)).astype(int)

# Rs = np.array(list(R.shape)).astype(int)

# Zs = np.array(list(Z.shape)).astype(int)

# R_start = np.zeros((len(shape),)).astype(int)

# R_stop = np.array(list(shape)).astype(int)

# Z_start = (P-Rs//2)

# Z_stop = (P+Rs//2)+Rs%2

# R_start = (R_start - np.minimum(Z_start,0)).tolist()

# Z_start = (np.maximum(Z_start,0)).tolist()

# R_stop = np.maximum(R_start, (R_stop - np.maximum(Z_stop-Zs,0))).tolist()

# Z_stop = (np.minimum(Z_stop,Zs)).tolist()

# r = [slice(start,stop) for start,stop in zip(R_start,R_stop)]

# z = [slice(start,stop) for start,stop in zip(Z_start,Z_stop)]

# R[r] = Z[z]

# print (Z)

# print (R)

81. 考慮一個數(shù)組Z = [1,2,3,4,5,6,7,8,9,10,11,12,13,14],如何生成一個數(shù)組R = [[1,2,3,4], [2,3,4,5], [3,4,5,6], ...,[11,12,13,14]]?

(提示: stride_tricks.as_strided)

In [ ]:

# Z = np.arange(1,15,dtype=np.uint32)

# R = stride_tricks.as_strided(Z,(11,4),(4,4))

# print (R)

82. 計算一個矩陣的秩

(提示: np.linalg.svd)

In [ ]:

# Z = np.random.uniform(0,1,(10,10))

# U, S, V = np.linalg.svd(Z) # Singular Value Decomposition

# rank = np.sum(S > 1e-10)

# print (rank)

83. 如何找到一個數(shù)組中出現(xiàn)頻率最高的值?

(提示: np.bincount, argmax)

In [ ]:

# Z = np.random.randint(0,10,50)

# print (np.bincount(Z).argmax())

84. 從一個10x10的矩陣中提取出連續(xù)的3x3區(qū)塊

(提示: stride_tricks.as_strided)

In [ ]:

# Z = np.random.randint(0,5,(10,10))

# n = 3

# i = 1 + (Z.shape[0]-3)

# j = 1 + (Z.shape[1]-3)

# C = stride_tricks.as_strided(Z, shape=(i, j, n, n), strides=Z.strides + Z.strides)

# print (C)

85. 創(chuàng)建一個滿足 Z[i,j] == Z[j,i]的子類

(提示: class 方法)

In [ ]:

# class Symetric(np.ndarray):

# def __setitem__(self, index, value):

# i,j = index

# super(Symetric, self).__setitem__((i,j), value)

# super(Symetric, self).__setitem__((j,i), value)

# def symetric(Z):

# return np.asarray(Z + Z.T - np.diag(Z.diagonal())).view(Symetric)

# S = symetric(np.random.randint(0,10,(5,5)))

# S[2,3] = 42

# print (S)

86. 考慮p個 nxn 矩陣和一組形狀為(n,1)的向量,如何直接計算p個矩陣的乘積(n,1)?

(提示: np.tensordot)

In [ ]:

# p, n = 10, 20

# M = np.ones((p,n,n))

# V = np.ones((p,n,1))

# S = np.tensordot(M, V, axes=[[0, 2], [0, 1]])

# print (S)

# It works, because:

# M is (p,n,n)

# V is (p,n,1)

# Thus, summing over the paired axes 0 and 0 (of M and V independently),

# and 2 and 1, to remain with a (n,1) vector.

87. 對于一個16x16的數(shù)組,如何得到一個區(qū)域(block-sum)的和(區(qū)域大小為4x4)?

(提示: np.add.reduceat)

In [ ]:

# Z = np.ones((16,16))

# k = 4

# S = np.add.reduceat(np.add.reduceat(Z, np.arange(0, Z.shape[0], k), axis=0),

# np.arange(0, Z.shape[1], k), axis=1)

# print (S)

88. 如何利用numpy數(shù)組實(shí)現(xiàn)Game of Life?

(提示:?Game of Life)

In [ ]:

# def iterate(Z):

# # Count neighbours

# N = (Z[0:-2,0:-2] + Z[0:-2,1:-1] + Z[0:-2,2:] +

# Z[1:-1,0:-2] + Z[1:-1,2:] +

# Z[2: ,0:-2] + Z[2: ,1:-1] + Z[2: ,2:])

# # Apply rules

# birth = (N==3) & (Z[1:-1,1:-1]==0)

# survive = ((N==2) | (N==3)) & (Z[1:-1,1:-1]==1)

# Z[...] = 0

# Z[1:-1,1:-1][birth | survive] = 1

# return Z

# Z = np.random.randint(0,2,(50,50))

# for i in range(100): Z = iterate(Z)

# print (Z)

89. 如何找到一個數(shù)組的第n個最大值?

(提示: np.argsort | np.argpartition)

In [ ]:

# Z = np.arange(10000)

# np.random.shuffle(Z)

# n = 5

# # Slow

# print (Z[np.argsort(Z)[-n:]])

In [ ]:

# # 方法2

# # Fast

# print (Z[np.argpartition(-Z,n)[:n]])

90. 給定任意個數(shù)向量,創(chuàng)建笛卡爾積(每一個元素的每一種組合)

(提示: np.indices)

In [ ]:

# def cartesian(arrays):

# arrays = [np.asarray(a) for a in arrays]

# shape = (len(x) for x in arrays)

# ix = np.indices(shape, dtype=int)

# ix = ix.reshape(len(arrays), -1).T

# for n, arr in enumerate(arrays):

# ix[:, n] = arrays[n][ix[:, n]]

# return ix

# print (cartesian(([1, 2, 3], [4, 5], [6, 7])))

91. 如何從一個正常數(shù)組創(chuàng)建記錄數(shù)組(record array)?

(提示: np.core.records.fromarrays)

In [ ]:

# Z = np.array([("Hello", 2.5, 3),

# ("World", 3.6, 2)])

# R = np.core.records.fromarrays(Z.T,

# names='col1, col2, col3',

# formats = 'S8, f8, i8')

# print (R)

92. 考慮一個大向量Z, 用三種不同的方法計算它的立方

(提示: np.power, \*, np.einsum)

In [ ]:

# x = np.random.rand()

# np.power(x,3)

In [ ]:

## 方法2

# x*x*x

In [ ]:

## 方法3

# np.einsum('i,i,i->i',x,x,x)

93. 考慮兩個形狀分別為(8,3) 和(2,2)的數(shù)組A和B. 如何在數(shù)組A中找到滿足包含B中元素的行?(不考慮B中每行元素順序)?

(提示: np.where)

In [ ]:

# A = np.random.randint(0,5,(8,3))

# B = np.random.randint(0,5,(2,2))

# C = (A[..., np.newaxis, np.newaxis] == B)

# rows = np.where(C.any((3,1)).all(1))[0]

# print (rows)

94. 考慮一個10x3的矩陣,分解出有不全相同值的行 (如 [2,2,3])

In [ ]:

# Z = np.random.randint(0,5,(10,3))

# print (Z)

# # solution for arrays of all dtypes (including string arrays and record arrays)

# E = np.all(Z[:,1:] == Z[:,:-1], axis=1)

# U = Z[~E]

# print (U)

In [ ]:

# # 方法2

# # soluiton for numerical arrays only, will work for any number of columns in Z

# U = Z[Z.max(axis=1) != Z.min(axis=1),:]

# print (U)

95. 將一個整數(shù)向量轉(zhuǎn)換為matrix binary的表現(xiàn)形式

(提示: np.unpackbits)

In [ ]:

# I = np.array([0, 1, 2, 3, 15, 16, 32, 64, 128])

# B = ((I.reshape(-1,1) & (2**np.arange(8))) != 0).astype(int)

# print(B[:,::-1])

In [ ]:

# # 方法2

# print (np.unpackbits(I[:, np.newaxis], axis=1))

96. 給定一個二維數(shù)組,如何提取出唯一的(unique)行?

(提示: np.ascontiguousarray)

In [ ]:

# Z = np.random.randint(0,2,(6,3))

# T = np.ascontiguousarray(Z).view(np.dtype((np.void, Z.dtype.itemsize * Z.shape[1])))

# _, idx = np.unique(T, return_index=True)

# uZ = Z[idx]

# print (uZ)

97. 考慮兩個向量A和B,寫出用einsum等式對應(yīng)的inner, outer, sum, mul函數(shù)

(提示:?np.einsum)

In [ ]:

# A = np.random.uniform(0,1,10)

# B = np.random.uniform(0,1,10)

# print ('sum')

# print (np.einsum('i->', A))# np.sum(A)

In [ ]:

# print ('A * B')

# print (np.einsum('i,i->i', A, B)) # A * B

In [ ]:

# print ('inner')

# print (np.einsum('i,i', A, B)) # np.inner(A, B)

In [ ]:

# print ('outer')

# print (np.einsum('i,j->ij', A, B)) # np.outer(A, B)

98. 考慮一個由兩個向量描述的路徑(X,Y),如何用等距樣例(equidistant samples)對其進(jìn)行采樣(sample)?

(提示: np.cumsum, np.interp)

In [ ]:

# phi = np.arange(0, 10*np.pi, 0.1)

# a = 1

# x = a*phi*np.cos(phi)

# y = a*phi*np.sin(phi)

# dr = (np.diff(x)**2 + np.diff(y)**2)**.5 # segment lengths

# r = np.zeros_like(x)

# r[1:] = np.cumsum(dr) # integrate path

# r_int = np.linspace(0, r.max(), 200) # regular spaced path

# x_int = np.interp(r_int, r, x) # integrate path

# y_int = np.interp(r_int, r, y)

99. 給定整數(shù)n和2D數(shù)組X,從X中選擇可以解釋為具有n度的多項(xiàng)分布的繪制的行,即,僅包含整數(shù)并且總和為n的行。

(提示: np.logical_and.reduce, np.mod)

In [ ]:

# X = np.asarray([[1.0, 0.0, 3.0, 8.0],

# [2.0, 0.0, 1.0, 1.0],

# [1.5, 2.5, 1.0, 0.0]])

# n = 4

# M = np.logical_and.reduce(np.mod(X, 1) == 0, axis=-1)

# M &= (X.sum(axis=-1) == n)

# print (X[M])

100. 計算1D陣列X的平均值的自舉95%置信區(qū)間(即,對替換N次的陣列的元素進(jìn)行重新采樣,計算每個樣本的平均值,然后計算均值上的百分位數(shù))。

In [ ]:

# X = np.random.randn(100) # random 1D array

# N = 1000 # number of bootstrap samples

# idx = np.random.randint(0, X.size, (N, X.size))

# means = X[idx].mean(axis=1)

# confint = np.percentile(means, [2.5, 97.5])

# print (confint)

轉(zhuǎn)載本文請聯(lián)系 科賽網(wǎng)kesci.com 取得授權(quán)。

?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請聯(lián)系作者
【社區(qū)內(nèi)容提示】社區(qū)部分內(nèi)容疑似由AI輔助生成,瀏覽時請結(jié)合常識與多方信息審慎甄別。
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點(diǎn),簡書系信息發(fā)布平臺,僅提供信息存儲服務(wù)。

相關(guān)閱讀更多精彩內(nèi)容

  • 基礎(chǔ)篇NumPy的主要對象是同種元素的多維數(shù)組。這是一個所有的元素都是一種類型、通過一個正整數(shù)元組索引的元素表格(...
    oyan99閱讀 5,286評論 0 18
  • 一、numpy概述 numpy(Numerical Python)提供了python對多維數(shù)組對象的支持:ndar...
    L_steven的貓閱讀 3,602評論 1 24
  • 先決條件 在閱讀這個教程之前,你多少需要知道點(diǎn)python。如果你想從新回憶下,請看看Python Tutoria...
    舒map閱讀 2,719評論 1 13
  • NumPy是Python中關(guān)于科學(xué)計算的一個類庫,在這里簡單介紹一下。 來源:https://docs.scipy...
    灰太狼_black閱讀 1,329評論 0 5
  • import numpy as np 創(chuàng)建ndarray data1 = [6,7.5, 8, 0, 1]arr1...
    陸文斌閱讀 821評論 0 1

友情鏈接更多精彩內(nèi)容