code: function fixArr(arr){
      // if(!isArray(arr)){
      //     throw new TypeError("arr is not a array!");
      // }
      let regNode = new RegExp("^" + _TreeChar_.T, "g"),
          regVert = new RegExp("^" + _TreeChar_.I ,"g"),
          S = " ";
      let i,iLen = arr.length;
      for(i=0;i<iLen;i++){
          let row = arr[i];
          // if(!isArray(row)){
          //     throw  new TypeError("arr is not a two-dimensional-array !");
          // }
          for(let j=0;j<row.length;j++){
              let o = row[j];
              if(isNodeStr(o)){
                  let checkNext = checkNextSibling(j,i,arr);
                  if(checkNext.isLast){
                      arr[i][j] = o.replace(regNode, _TreeChar_.L);// "├" => "└"
                      for(let c=i+1;c<checkNext.hPos;c++){
                          if(arr[c]){
                              if(!!arr[c][j] && !!arr[c][j].match(regVert)){
                                  arr[c][j] = arr[c][j].replace(regVert,S);// "│" => " "
                              }
                          }
                      }
                  }
              }
          }
      }
  
      // fix root: "└" => "", "─" => " "
      let regSimRoot1 = new RegExp(_TreeChar_._,"gi"),
          regSimRoot2 = new RegExp(_TreeChar_.T + "|" +  _TreeChar_.L,"g");
      arr[0][0] = arr[0][0].replace(regSimRoot1," ").replace(regSimRoot2,"");
  
      return arr;
  }
docs: 修复简单粗暴生成的二位数字，以便生成正确的节点连接符