请教一个算法问题?
请教一个算法问题
输入原数组(按start排序, 并且下一项的start一定>=前一项的end)
[
{ "start": 1, "end": 2, "content": [ "A", "B", "E" ] }, //0
{ "start": 2, "end": 3, "content": [ "B", "C" ] }, //1
{ "start": 3, "end": 4, "content": [ "B", "D" ] }, //2
{ "start": 4, "end": 5, "content": [ "D" ] }, //3
{ "start": 7, "end": 8, "content": [ "B" ] }, //4
{ "start": 9, "end": 11, "content": [ "B", "C" ] } //5
]
提取出连续的相同项合并成一个新的对象, 插入原数组, 根据start和end判断是否连续如例子里的(0,1,2)项里的B 提取并合并得到{ "start": 1, "end": 4, "content": ["B"] }
(2,3)项里的D 提取并合并得到{ "start": 3, "end": 5, "content": ["D"] }
插入原数组后再按start, end 排序
提取后, (3)项会变为{ "start": 4, "end": 5, "content": [ ] }
content长度为0, 需要移除
最后输出
[
{ "start": 1, "end": 2, "content": [ "A", "E" ] },
{ "start": 1, "end": 4, "content": [ "B" ] },
{ "start": 2, "end": 3, "content": [ "C" ] },
{ "start": 3, "end": 5, "content": [ "D" ] },
{ "start": 7, "end": 8, "content": [ "B" ] },
{ "start": 9, "end": 11, "content": [ "B", "C" ] }
]
回复
1个回答

test
2024-06-30
let arr = [
{ "start": 1, "end": 2, "content": [ "A", "B", "E" ] }, //0
{ "start": 2, "end": 3, "content": [ "B", "C" ] }, //1
{ "start": 3, "end": 4, "content": [ "B", "D" ] }, //2
{ "start": 4, "end": 5, "content": [ "D" ] }, //3
{ "start": 7, "end": 8, "content": [ "B" ] }, //4
{ "start": 9, "end": 11, "content": [ "B", "C" ] } //5
]
let obj = {}
let list = arr.reduce((list, item, index, arr) => {
item.content.forEach(citem => {
let i = index
let next, cindex
while ((next = arr[i + 1]) && arr[i].end === next.start && (cindex = next.content.indexOf(citem)) >= 0) {
i++
next.content.splice(cindex, 1)
}
let end = arr[i].end
let key = item.start + '-' + end
if(!obj[key]){
list.push(obj[key] = {
start: item.start,
end,
content: [citem]
})
}else{
obj[key].content.push(citem)
}
})
return list
}, [])
console.log(list)
回复

适合作为回答的
- 经过验证的有效解决办法
- 自己的经验指引,对解决问题有帮助
- 遵循 Markdown 语法排版,代码语义正确
不该作为回答的
- 询问内容细节或回复楼层
- 与题目无关的内容
- “赞”“顶”“同问”“看手册”“解决了没”等毫无意义的内容