[英]javascript: how to find the key in an associative array that is closest to a value?
我有类似的东西
var keyVals = Array;
keyVals['23'] = 234;
keyVals['58'] = 'sunshine';
keyVals['172'] = 'lolipops';
newVar = 76;
我怎样才能找到数组中哪个键的值(一旦被数字化)最接近newVar? 23、58、172中哪一个最接近我的76岁?
谢谢
首先,请注意,您实际上是在创建对象,因此keyVals的首选分配是keyVals = {}
。
var newVar = 31,
keyNum,
key,
diff,
keyVals = {},
closest = {
key: null,
diff: null
};
keyVals['23'] = 234;
keyVals['58'] = 'sunshine';
keyVals['172'] = 'lolipops';
for(key in keyVals) {
if(keyVals.hasOwnProperty(key)) {
keyNum = parseInt(key,10);
diff = Math.abs(newVar - keyNum);
if(!closest.key || diff < closest.diff) {
closest.key = key;
closest.diff = diff;
}
}
}
当for
循环完成时, closest.key
将包含与newVar
最接近的匹配项的索引。 为了提供额外的保护,请使用hasOwnProperty
来确保您不会意外地迭代keyVals
原型之一的属性(当然,在这种特定情况下,这不太可能发生)。
首先:
如果您使用数字类型的值作为键,则它们必须保留数字。
应该是23,而不是“ 23”
否则,23将被视为字符串'23',无法对数字进行数学测试。
var keyVals = Array;
keyVals[23] = 234; // keyVals[23], not keyVals['23']
keyVals[58] = 'sunshine';
keyVals[172] = 'lolipops'
要找到最接近的键,
只需循环浏览您的按键并搜索最接近的按键即可。
dist = Number.POSITIVE_INFINITY; // set the distance from key to value
closestkey = -1; // closest key variable
for(i in keyVals) {
// i is the key, keyVals[i] is the value
newdist = Math.abs(newVar - i); // distance from current key to value
if (newdist < dist) {
// we found a key closer to the value
dist = newdist; // set new smallest distance
closestkey = i; // set the value to the current key
}
}
// Now closestkey is the key to your closest variable
但是请注意,可能存在2个最接近newVar
。
例如:
keyVals[23] = 234;
keyVals[129] = 'aaa';
keyVals[172] = 'lolipops';
23和129最接近76。
然后,
var keyVals = Array;
keyVals[23] = 234;
keyVals[129] = 'aaa';
keyVals[172] = 'lolipops';
newVar = 76;
var closest=new Object();
for(var i in keyVals){
if(typeof closest.dif=='undefined'){
closest.dif=Math.abs(newVar-i);
closest.val=[i];
}else{
if(closest.dif==Math.abs(newVar-i)){
closest.val.push(i);
}else if(closest.dif>Math.abs(newVar-i)){
closest.dif=Math.abs(newVar-i);
closest.val=[i];
}
}
}
alert("The closest keys to "+newVar+" are ["+closest.val.join(',')+"], with a difference of "+closest.dif);
将警告“最接近76的键是[23,129],相差53”
或与您的阵列,
keyVals[23] = 234;
keyVals[58] = 'sunshine';
keyVals[172] = 'lolipops';
会提示“最接近76的键是[58],相差18”
正如其他人指出的那样,当您想将键映射到值时, Objects
(又称为哈希)是最好的数据结构。 考虑到这一点,您将看到将映射键按数字顺序预先排序的性能优势。
// Helper method, you could also use underscore.js's `_.keys`
function getKeys(object) {
var keys = [];
for (var key in object) {
if (object.hasOwnProperty(key)) {
keys.push(key);
}
}
return keys;
};
// Lookup table.
var keyVals = {
23: "234",
58: "sunshine",
172: "lollypops"
};
// Extract the keys from the lookup table and sort them into numerical order.
var sortedKeys = getKeys(keyVals).sort(function (a, b) {
return a - b;
});
// Returns the closest key in the `keyVals` lookup table for the supplied value.
function getClosestIndex(value) {
var i;
// Walk through the sorted keys array and stop when the next value is greater.
for (i = 0; i < sortedKeys.length; i++) {
if (sortedKeys[i] > value) {
// Either return the previous key, or zero if this was the first.
return (i === 0) ? sortedKeys[0] : sortedKeys[i - 1];
}
}
// We reached the end, so the value is greater than the highest key we have.
return sortedKeys[i];
}
显然,如果您的keyVals
映射很小(少于1000个条目),那么这种优化是相当学术的(但仍然很有趣):)
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.