js算法题之矩阵斜遍历

function deciphering (arr) {
    let decipheringStr = ''
    let m = arr[0].length;
    let n = arr.length
    console.log(m + n)
    for (let i = 0; i < m + n - 1; i++) {
        for (let row = 0; row <= i; row++) {
            let col = i - row;
            if (col < n && col >= 0 && row < m) {
                console.log(row, col)
                decipheringStr += arr[row][col]
            }
        }
    }
    console.log(decipheringStr)
}
deciphering([
    ["你", "喜", "林"],
    ["欢", "浩", "不"],
    ["是", "是", "？"]
]) //你喜欢林浩是不是？