假设我有一个预先排序的对象数组,例如:
let data = [
{ moment: '00:01', otherProp: 'something', somethingMore: 'someelse'},
{ moment: '01:10', otherProp: 'something', somethingMore: 'someelse'},
{ moment: '05:37', otherProp: 'something', somethingMore: 'someelse'},
{ moment: '07:51', otherProp: 'something', somethingMore: 'someelse'},
//and so on
]
我输入了格式化为小时:分钟字符串的 x (例如 x='06:05'(,我需要找到两个连续的对象(数据 [i] 和数据 [i+1](,以便 data[i].moment <= x <data[i+1].moment>
假设数组有近 200 个元素,我需要最快的方法来找到结果。我必须从头开始实现二叉搜索吗?有我可以使用的图书馆吗?
有什么我必须从头开始实现二叉搜索吗?
意义?它只是几行代码:
let data = [
{ moment: '00:01', otherProp: 'something', somethingMore: 'someelse'},
{ moment: '01:10', otherProp: 'something', somethingMore: 'someelse'},
{ moment: '05:37', otherProp: 'something', somethingMore: 'someelse'},
{ moment: '07:51', otherProp: 'something', somethingMore: 'someelse'},
//and so on
];
let search = '06:05';
let lo = -1, hi = data.length-1, mid;
while(hi > lo){
if(data[mid=(lo+hi+1)>>1].moment > search) {
hi = mid-1;
} else {
lo = mid;
}
}
console.log(data[lo]);
console.log(search);
console.log(data[lo+1]);
.as-console-wrapper{top:0;max-height:100%!important}
var pos = data.indexOf(data.find(function(obj) {
var value = (obj.moment.split(":")[0]*60) + (obj.moment.split(":")[1]*1)
var key =(search.split(":")[0]*60) + (search.split(":")[1]*1);
return (key < value);
}));
pos = pos >= 0 ? pos : data.length
data.splice(pos, 0, {moment:search, otherProp:"something", somethingMore: "someelse"});
这将起作用。