首页 > 编程语言 > 详细

2.python算法之回形矩阵

时间:2016-03-21 19:49:26      阅读:299      评论:0      收藏:0      [点我收藏+]

代码:

#!/usr/bin/env python
# encoding: utf-8
"""
@author: 侠之大者kamil
@file: 2.回形矩阵.py
@time: 2016/3/21 10:51
"""
def sankeMatric(n):
    m = [[0] * n for x in range(n)]
    p = 0
    q = n-1
    t = 1
    while p < q:
        for i in range(p,q):
            m[p][i] = t
            t +=1
        for i in range(p,q):
            m[i][q] = t
            t +=1
        for i in range(q,p,-1):
            m[q][i] = t
            t +=1
        for i in range(q,p,-1):
            m[i][p] = t
            t +=1
        p +=1
        q -=1
    if p ==q:
        m[p][p] = t
    return m
b = int(input("please input the number:"))
a = sankeMatric(b)
for l in a:
    print(l)

def func():
    pass


class Main():
    def __init__(self):
        pass


if __name__ == __main__:
    pass

 

2.python算法之回形矩阵

原文:http://www.cnblogs.com/kamil/p/5302959.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!