Fe-interview: [js] 第553天 使用js写个方法，把下列数组对象按多字段排序，name升序，age降序

[haizhilin2013]

第553天 使用js写个方法，把下列数组对象按多字段排序，name升序，age降序

3+1官网

我也要出题

let listData = [
        { name: "张三", age: 38, num: 123 },
        { name: "李四", age: 15, num: 678 },
        { name: "王王", age: 16, num: 256 },
        { name: "老六", age: 28, num: 256 },
        { name: "老王", age: 16, num: 789 },
        { name: "大一", age: 23, num: 678 },
        { name: "大二", age: 20, num: 123 },
        { name: "大三", age: 40, num: 989 }
      ];

[wheatup]

根据题意，如果name的排序优先级大于age，因为没有重名的人，所以age的降序没有任何作用，所以这里只针对姓氏进行升序排序：

let listData = [
    { name: "张三", age: 38, num: 123 },
    { name: "李四", age: 15, num: 678 },
    { name: "王王", age: 16, num: 256 },
    { name: "老六", age: 28, num: 256 },
    { name: "老王", age: 16, num: 789 },
    { name: "大一", age: 23, num: 678 },
    { name: "大二", age: 20, num: 123 },
    { name: "大三", age: 40, num: 989 }
];

listData.sort((a, b) => a.name[0].localeCompare(b.name[0], 'zh-CN') || b.age - a.age);

[wolichuang]

let listData = [
  { name: '张三', age: 38, num: 123 },
  { name: '李四', age: 15, num: 678 },
  { name: '王王', age: 16, num: 256 },
  { name: '老六', age: 28, num: 256 },
  { name: '老王', age: 16, num: 789 },
  { name: '大一', age: 23, num: 678 },
  { name: '大一', age: 43, num: 678 },
  { name: '大二', age: 20, num: 123 },
  { name: '大三', age: 40, num: 989 }
];

const sortName = listData.sort((a, b) =>
  a.name[0].localeCompare(b.name[0], 'zh-CN')
);

const listData2 = sortName.sort((a, b) => {
  if (a.name == b.name) {
    return b.age - a.age;
  }
  return;
});
console.log(listData2);

[jiangyanghe]

stringObj.localCompare('') 和 sort(a,b)

[JoneRight]

`` //根据age排个序
for (let i = 0; i < listData.length - 1; i++) {
for (let j = 0; j < listData.length - 1 - i; j++) {
//升序
if (listData[j].age > listData[j + 1].age) {
let temp = listData[j]
listData[j] = listData[j + 1]
listData[j + 1] = temp
}
}
}
//先生成长度为listData长度的空数组
let qqq = []
for (let k = 0; k < listData.length; k++) {
qqq[k] = []
}
let j = 0
// debugger
for (let i = 0; i < listData.length - 1; i++) {
if (listData[i].age == listData[i + 1].age) {
qqq[j].push(listData[i], listData[i + 1])
} else {
// 判断是否是最后一个
// 如果是最后一个，还不和倒数第二个相同，那么需要加入新的数组中
if (i == listData.length - 2) {
qqq[j].push(listData[i])
j++
qqq[j].push(listData[i + 1])
} else {
qqq[j].push(listData[i])
j++
}
}
}
//去掉空数组
function removeEmpty(arr) {
for (let i = 0; i < arr.length; i++) {
if (arr[i].length == 0) {
arr.splice(i, 1)
i--
}
}
return arr
}
let ppp = removeEmpty(qqq)
//去重
for (let i = 0; i < ppp.length; i++) {
if (ppp[i].length > 1) {
let temp = []
for (let k = 0; k < ppp[i].length; k++) {
//先创建一个新数组
if (temp.indexOf(ppp[i][k]) < 0) {
temp.push(ppp[i][k])
}
}
ppp[i] = temp
}
}
console.log(ppp)