数组排序、去重

1.初步排序

let arr1 = [2, 1, 3, 2, 4, 5, 4, 7];
let arr2 = [
  [1, 2],
  [3, 4],
  [5, 1],
];
let obj = [{ c: 1 }, { c: 5 }, { c: 3 }];

1.arr1.sort((a,b)=>a-b) //会改变原数组 >arr1=[1,2,2,3,4,4,7]

2.arr2.sort((a,b)=>a[0]-a[0]) // >arr2=[[1,2],[3,4],[5,1]]
arr2.sort((a,b)=>a[1]-a[1]) // >arr2=[[5,1],[1,2],[3,4]
obj.sort((a,b)=>a.c-b.c) // >obj=[{c:1},{c:3},{c:5}]

3.let arr0=[...new Set(arr1)] //去重 >arr0=[2,1,3,4,5,7]

2.中文排序

let array = ["武汉", "北京", "上海", "天津"];
let resultArray = array.sort(function (param1, param2) {
  return param1.localeCompare(param2, "zh");
});
console.log(resultArray);

3.指定数组排序

实时编辑器

function Test() { // order是规则 objs是需要排序的数组 function arraySortArray(objs, order, key) { // 初步深复制避免影响原数组，可自己更改 const cache = JSON.parse(JSON.stringify(objs)); cache.sort(function (a, b) { return order.indexOf(a[key]) - order.indexOf(b[key]); }); return cache; } const objs = [ { name: "A", type: "1" }, { name: "F", type: "6" }, { name: "E", type: "5" }, { name: "H", type: "8" }, { name: "D", type: "4" }, { name: "C", type: "3" }, ]; const order = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10"]; const res = arraySortArray(objs, order, "type"); // 编辑器实时输出结果 return ( <ul> {res.map((item) => ( <li key={item.type}>{JSON.stringify(item)}</li> ))} </ul> ); }

function Test() {
  // order是规则  objs是需要排序的数组
  function arraySortArray(objs, order, key) {
    // 初步深复制避免影响原数组，可自己更改
    const cache = JSON.parse(JSON.stringify(objs));
    cache.sort(function (a, b) {
      return order.indexOf(a[key]) - order.indexOf(b[key]);
    });
    return cache;
  }

  const objs = [
    { name: "A", type: "1" },
    { name: "F", type: "6" },
    { name: "E", type: "5" },
    { name: "H", type: "8" },
    { name: "D", type: "4" },
    { name: "C", type: "3" },
  ];
  const order = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10"];
  const res = arraySortArray(objs, order, "type");
  // 编辑器实时输出结果
  return (
    <ul>
      {res.map((item) => (
        <li key={item.type}>{JSON.stringify(item)}</li>
      ))}
    </ul>
  );
}

结果

Loading...