zoukankan      html  css  js  c++  java
  • 2.python算法之回形矩阵

    代码:

    #!/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
    公众号请关注:侠之大者
  • 相关阅读:
    产品微谈
    SVN回滚机制
    super究竟是个啥?
    PM12条
    CocoaPods初体验
    UIView局部点击
    Memory cycles about Block
    About "self"
    openfire学习(一)
    WPF菜单和布局(2)
  • 原文地址:https://www.cnblogs.com/kamil/p/5302959.html
Copyright © 2011-2022 走看看