zoukankan      html  css  js  c++  java
  • 数组算法

    1 1 1 1 1
    1 2 2 2 1
    1 2 3 2 1
    1 2 2 2 1
    1 1 1 1 1

    维数只能为奇数

    int n = 4;
            int[,] array = new int[2*n-1, 2*n-1];
            for (int i = 1; i < n+1; i++)
            {
                for (int j = i-1; j < 2*n-i; j++)
                    for (int k = i - 1; k < 2*n - i; k++)
                        array[j, k] = i;
            }
            for (int i = 0; i < 2*n-1; i++)
            {
                for (int j = 0; j < 2*n-1; j++)
                    Response.Write(array[i,j]);
                Response.Write("<br />");
            }

  • 相关阅读:
    64_q2
    64_q1
    64_p10
    64_p9
    64_p8
    64_p7
    64_p6
    64_p5
    64_p4
    64_p3
  • 原文地址:https://www.cnblogs.com/hyd309/p/1316098.html
Copyright © 2011-2022 走看看