通过匹配启动和结束节点来对项目进行排序



假设我有一系列属于不同组的随机洗牌片。例如:

let pieces = [
  {
    id: "a1",
    startNode: 18,
    endNode: 42,
  },
  {
    id: "a3",
    startNode: 16,
    endNode: 30,
  },
  {
    id: "b2",
    startNode: 48,
    endNode: 65,
  },
  {
    id: "a2",
    startNode: 42,
    endNode: 16,
  },
  {
    id: "a4",
    startNode: 30,
    endNode: 31,
  },
  {
    id: "b1",
    startNode: 23,
    endNode: 48,
  },
];

我希望它们以正确顺序为两个阵列:

ordered = [
  [
    {
      id: "a1",
      startNode: 18,
      endNode: 42,
    },
    {
      id: "a2",
      startNode: 42,
      endNode: 16,
    },
    {
      id: "a3",
      startNode: 16,
      endNode: 30,
    },
    {
      id: "a4",
      startNode: 30,
      endNode: 31,
    },
  ],[
    {
      id: "b1",
      startNode: 23,
      endNode: 48,
    },
    {
      id: "b2",
      startNode: 48,
      endNode: 65,
    },
  ]
];

他们通过匹配的启动和结束节点进行排序,因此" A2"在" A1"之后进行,因为其启动节点与" A1" S EndNode匹配。" B1"one_answers" B2"属于另一组,因为它们不与任何" A"组共享起始节点或结束节点。ID不能用于排序,这只是为了清晰。

关于如何做的任何想法?我认为它需要某种递归功能,我不能完全将其纳入我的脑海。

您可以使用迭代方法,同时迭代sub结果以及针对实际(外部(元素。

此单个元素在数组中收集所有匹配的启动和结束节点,而其他非匹配节点被过滤,然后以收集阵列置为contined。

var pieces = [{ id: "a1", startNode: 18, endNode: 42 }, { id: "a3", startNode: 16, endNode: 30 }, { id: "b2", startNode: 48, endNode: 65 }, { id: "a2", startNode: 42, endNode: 16 }, { id: "a4", startNode: 30, endNode: 31 }, { id: "b1", startNode: 23, endNode: 48 }],
    result = pieces.reduce(function (r, a) {
        var temp = [a];
        return r.filter(function (b) {
            if (temp[temp.length - 1].endNode === b[0].startNode) {
                temp = temp.concat(b);
                return;
            }
            if (temp[0].startNode === b[b.length - 1].endNode) {
                temp = b.concat(temp);
                return;
            }
            return true;
        }).concat([temp]);
    }, []);
console.log(result);
.as-console-wrapper { max-height: 100% !important; top: 0; }

尝试简单的Array#sort() => a.id > b.id

let pieces = [ { id: "a1", startNode: 18, endNode: 42, }, { id: "a3", startNode: 16, endNode: 30, }, { id: "b2", startNode: 48, endNode: 65, }, { id: "a2", startNode: 42, endNode: 16, }, { id: "a4", startNode: 30, endNode: 31, }, { id: "b1", startNode: 23, endNode: 48, }, ];
console.log(pieces.sort((a,b)=> a.id > b.id))

未支撑的箭头功能=> ES5

一起使用
   console.log(
    pieces.sort(function(a,b){
    return a.id > b.id})
    )

最新更新