zoukankan      html  css  js  c++  java
  • 遍历成自己想要的数组

    getSeriesData (arr = []) {
          let serArr = []
          let [...arrDayArrs] = this.defaultData()
          let arrData = []
          // console.log(arrDayArrs)
          arr.forEach((elementindex=> {
            let serObj = {}
            serObj.name = element.channelName
            arrData[index] = JSON.parse(JSON.stringify(arrDayArrs))
            if (element.data) {
              arrData[index].forEach(item => {
                element.data.forEach(subEle => {
                  if (subEle.time === item.time) {
                    item.time = subEle.time
                    item.grandCount = subEle.grandCount
                  }
                })
                serObj.data = arrData[index]
              })
            }
            serArr.push(serObj)
          })
          console.log(serArr)
          return serArr
        },
  • 相关阅读:
    usaco-ariprog1-pass
    usaco-crypt1-pass
    usaco-barn-repair-pass-KISS
    usaco-mixing milk-pass
    面试HR
    LCS求最长公共子序列(DP)
    毕业随想(转载)
    0-1背包问题(DP)
    排序算法
    二叉搜索树的实现 java
  • 原文地址:https://www.cnblogs.com/qdwz/p/11897228.html
Copyright © 2011-2022 走看看