#转载:http://cache.baiducontent.com/c?m=9d78d513d99f06f01aa6837f7d01a66d0e20f3744cd6c76474c3923884155d563463f4cb22356072c4c40c7071d85e2ae0e74075207721a3dc88d64587fdd46a388954296d59c30405d36eff8c1662987d875a9efe44b8a7ab6ec7f384849907089444050c80f189590412cd78f0636ba5f9c7&p=853dc816d9c111a05bebd038465d&newp=882a96439f8312a05ab28c6f7f4992695d0fc20e3dd3d601298ffe0cc4241a1a1a3aecbf20251a05d5c5776506a84e5ae8f334703d0034f1f689df08d2ecce7e66c8&user=baidu&fm=sc&query=numpy%C9%FA%B3%C9%C4%A7%B7%BD%BE%D8%D5%F3&qid=ad291546000112b1&p1=4 import numpy as np def magic(n): row,col=0,n//2 magic=[] for i in range(n): magic.append([0]*n) magic[row][col]=1 for i in range(2,n*n+1): r,l=(row-1+n)%n,(col+1)%n if(magic[r][l]==0): row,col=r,l else: row=(row+1)%n magic[row][col]=i marray = np.array(magic) return marray if __name__ == ‘__main__‘: y = magic(7) print y print type(y)
python中magic魔方算法实现
猜你喜欢
转载自blog.csdn.net/qq_25964837/article/details/80460202
今日推荐
周排行