• JS将某个数组分割为N个对象一组(如,两两一组,三三一组等)


    方法一:

    var result = [];

    var data = [

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

      {name:'chen',age:'25'},

    ]

    for(var i=0;i<data.length;i+=3){

        result.push(data.slice(i,i+3));

    }

      //[

    //[{name:'chen',age:'25'},{name:'chen',age:'25'},{name:'chen',age:'25'}],

    //[{name:'chen',age:'25'},{name:'chen',age:'25'},{name:'chen',age:'25'}],

    //[{name:'chen',age:'25'},{name:'chen',age:'25'},{name:'chen',age:'25'}],

    //[{name:'chen',age:'25'}],

      //]

    方法二:

    var spArray = function(N,Q){

    var R = [],F;

    for (F = 0;F < Q.length;) {

    R.push(Q.slice(F,F += N))

    }

    return R

    }

    var arr = [1,2,3,4,5,6,7,8,9,10,11,12,13,14];

    console.log(spArray(5,arr))//[[1,2,3,4,5],[6,7,8,9,10],[11,12,13,14]]

    原文链接:https://blog.csdn.net/qq_43156398/article/details/90715915

  • 相关阅读:
    LCA最近公共祖先Tarjan(离线)
    51nod 1135 原根
    51nod 1134最长递增子序列
    51nod 1130 斯特林公式
    51nod 1186 Miller-Rabin素数测试
    51Nod 1257 背包问题 V3
    另类求组合数
    Gym
    msp430项目编程45
    msp430项目编程44
  • 原文地址:https://www.cnblogs.com/zhang-hong/p/14971549.html
Copyright © 2020-2023  润新知