JS二维数组排序的问题

cqwcns

如下代码，我希望根据区域的总数进行排序（即对各区域数值进行求和，在根据求和结果进行排序）。
不知道应该这么写，请各位大佬指教，感谢。

[JavaScript] 纯文本查看 复制代码

      const arrData = [
                [东区', 50, 67, 0, 17, 67, 50, 0],
                ['西区', 32, 45, 13, 65, 48, 97, 3],
                ['南区', 35, 3, 0, 10, 16, 97, 97],
                ['北区', 29, 32, 3, 94, 90, 97, 97],
                ['中区', 33, 33, 33, 50, 33, 33, 33]
            ];

        const arr = arrData.sort(function (a, b) {
            console.log(a.slice(1))
            return a.slice(1) - b.slice(1)
        })

        console.log('arr', arr)

Pwaerm

[Asm] 纯文本查看 复制代码

const arrData = [
    ['东区', 50, 67, 0, 17, 67, 50, 0],
    ['西区', 32, 45, 13, 65, 48, 97, 3],
    ['南区', 35, 3, 0, 10, 16, 97, 97],
    ['北区', 29, 32, 3, 94, 90, 97, 97],
    ['中区', 33, 33, 33, 50, 33, 33, 33]
];
function getTotal(_array) {
    var _count = 0;
    var _t = _array.length;
    while (_t--) {
        var _n = Number(_array[_t]);
        if (!isNaN(_n)) {
            _count += _n;
        }
    }
    return _count;
}
const arr = arrData.sort(function (a, b) {
    return getTotal(a) - getTotal(b);
})

console.log('arr', arr)

Pwaerm

[Asm] 纯文本查看 复制代码

const arr = arrData.sort(function (a, b) {
    return eval(a.slice(1).join("+")) - eval(b.slice(1).join("+"))
})

这样也行，但不太灵活

rosguy

[JavaScript] 纯文本查看 复制代码

let arrData = [
    ['东区', 50, 67, 0, 17, 67, 50, 0],
    ['西区', 32, 45, 13, 65, 48, 97, 3],
    ['南区', 35, 3, 0, 10, 16, 97, 97],
    ['北区', 29, 32, 3, 94, 90, 97, 97],
    ['中区', 33, 33, 33, 50, 33, 33, 33]
  ];
  let res = arrData.sort((a,b)=>a.slice(1).reduce((p,v)=>p+v)-b.slice(1).reduce((p,v)=>p+v));
  console.log(res);

lcbreak

[JavaScript] 纯文本查看 复制代码

const arrData = [
          ['东区', 50, 67, 'aa', 17, 67, 50, 0],    //==>251
          ['西区', 32, 45, 13, 65, 48, 97, 3],  //==>303
          ['南区', 35, 3, 0, 10, 16, 97, 97],   //==>258
          ['北区', 29, 32, 3, 94, 90, 97, 97],  //==>442
          ['中区', 33, 33, 33, 50, 33, 33, 33]  //==>248
];

function getTotal(arr) { 
    let count = 0;
    let index = arr.length-1;
    while (index) {
        if (!isNaN(arr[index])) {
            count += arr[index];
        }
        index--;
    }
    return count

}

const arr = arrData.sort((a, b) => getTotal(a) - getTotal(b))
console.log(arr);

这样应该符合要求。

kawaii

[JavaScript] 纯文本查看 复制代码

const arrData = [
    ['东区', 50, 67, 0, 17, 67, 50, 0],
    ['西区', 32, 45, 13, 65, 48, 97, 3],
    ['南区', 35, 3, 0, 10, 16, 97, 97],
    ['北区', 1, 2, 3, 1, 1, 97, 1],
    ['中区', 33, 33, 33, 50, 33, 33, 33]
];

const arr = arrData.sort(function (a, b) {
    let aTotal = 0;
    let bTotal = 0;
    a.slice(1).forEach((num) => {
        aTotal += num;
    })
    b.slice(1).forEach((num) => {
        bTotal += num;
    })

    return aTotal - bTotal
})
arr.forEach(arr => {
    console.log(arr)
})

在你代码基础上稍微调整了一下

涛之雨

const arrData = [
    ['东区', 50, 67, 0, 17, 67, 50, 0],
    ['西区', 32, 45, 13, 65, 48, 97, 3],
    ['南区', 35, 3, 0, 10, 16, 97, 97],
    ['北区', 29, 32, 3, 94, 90, 97, 97],
    ['中区', 33, 33, 33, 50, 33, 33, 33]
];
const val=arrData.map(a=>[a[0],a.slice(1).reduce((a,b)=>a+b,0)]).sort((a,b)=>a-b)
console.log(val)

emmm我是不是理解错题目了。。。问题不大，楼上有正确的

侃遍天下无二人

这样？是不是很优雅

[JavaScript] 纯文本查看 复制代码

const arrData = [
    ['东区', 50, 67, 0, 17, 67, 50, 0],
    ['西区', 32, 45, 13, 65, 48, 97, 3],
    ['南区', 35, 3, 0, 10, 16, 97, 97],
    ['北区', 1, 2, 3, 1, 1, 97, 1],
    ['中区', 33, 33, 33, 50, 33, 33, 33]
]

arrData.map(x => {
   return [x[0],(x[1]+x[2]+x[3]+x[4]+x[5]+x[6]+x[7]) ]
}).sort( (x,y)=> {
   return x[1] - y[1]
})

稍微优化了下，这样就更省内存了

[JavaScript] 纯文本查看 复制代码

arrData.sort( (x,y) => {
    let result = 0
    for(let i=1;i<=7;i++){
        result += x[i]-y[i]
    }
    return result
})

dode

const arrData = [
    ['东区', 50, 67, 0, 17, 67, 50, 0],
    ['西区', 32, 45, 13, 65, 48, 97, 3],
    ['南区', 35, 3, 0, 10, 16, 97, 97],
    ['北区', 29, 32, 3, 94, 90, 97, 97],
    ['中区', 33, 33, 33, 50, 33, 33, 33]
];

const arr = arrData.sort(function (a, b) {
  const sumA = a.slice(1).reduce((acc, cur) => acc + cur);
  const sumB = b.slice(1).reduce((acc, cur) => acc + cur);
  return sumB - sumA;
});

console.log('arr', arr);