js输出一个指定大小的风车

TON_G-T

已于 2022-04-26 19:58:34 修改

阅读量115

点赞数 3

文章标签： JavaScript 矩阵排列组合字符串操作循环

于 2022-04-22 00:54:58 首次发布

本文链接：https://blog.csdn.net/qq_45923489/article/details/124335602

版权

 let n = 7
    function zi(res,i,t,o){
        for (let j = 0; j < t; j++) {
                if (i == 0 || j == 0 || j == o) {
                    res += '*'
                } else {
                    res += " "
                }
            }
            return res
    }
    function kon(res,i,q,p){
        for (let j = q; j <= p; j++) {
                res += ' '
            }
            return res
    }
   
    let result = []
        for (let i = 0; i < n - 1; i++) {
            let res = ''           
            result.push(zi(res,i,n-i,n - i - 1)+kon(res,i,1,i))
        }
    let result2 = []
    for (let i = 0; i < n - 1; i++) {
            let res = ''           
            result2.push(kon(res,i,1,i)+zi(res,i,n-i,n - i - 1))
        }
        result2=result2.reverse()
    let result3 = []
    for (let i = 0; i < n - 1; i++) {
            let res = ''
            result3.push(kon(res, i,0,n-i-3)+zi(res, i,i+1,i) )
        }
        result3=result3.reverse()
    let result1 = []
    for (let i = 0; i < n - 1; i++) {
            let res = ''
            result1.push(zi(res, i, i + 1, i)+kon(res, i, 0, n - i - 3)  )
        }
    let a1 = []
    let s = ''
    for (let i = 0; i < n - 1; i++) {
        a1.push(result1[i] + result[i])
        s += '*'
    }
    a1.push(s + s + '*')
    for (let i = 0; i < n - 1; i++) {
        a1.push(result2[i] + result3[i])
    }
    for (let i = 0; i < 2 * n - 1; i++) {
        console.log(a1[i])
    }