比较字典中值的差异

时间:2015-08-14 09:15:13

标签: c# linq dictionary

我有Dictionary<string, float>并希望从中选择KeyValuePairs,其中float-values之间的差异小于某个阈值。

这是字典:

Dictionary<string, float> heights = new Dictionary<string, float> ();

示例条目:

"first", 61.456
"second", 80.567
"third", 62.456
"4", 59.988
"5", 90.34
"6", 82.123

我需要这些元素,它们的值差异很小,例如:列表中的“第一”,“第三”和“4”或类似的东西。差异是一个给定的浮点值,比如说3.5

Linq可以实现吗?

我尝试使用循环来做这件事,但不知何故它变得非常混乱......

3 个答案:

答案 0 :(得分:1)

您可以先按值对条目进行排序,然后比较附近的条目会更容易。

var list = heights.ToList();
list.Sort((a,b) => {return a.Value.CompareTo(b.Value);});
bool first = true;
for (int i = 1; i < list.Count; ++i)
{
    if (Math.Abs(list[i-1].Value - list[i].Value) < threshold)
    {
        if (first)
        {
            first = false;
            Console.WriteLine(list[i-1]);
        }
        Console.WriteLine(list[i]);
    }
}

dotnetfiddle上的一个工作示例here

答案 1 :(得分:1)

您可以创建查找close值的自定义方法并接受两个参数:保存值的字典和float,用于保存最大查找范围:

    static Dictionary<string, float> FindRange(Dictionary<string, float> dict, float precision)
    {
        Dictionary<string, float> temp = new Dictionary<string, float>();
        List<int> counter = new int[dict.Count].ToList(); float[] values = dict.Values.ToArray();            

        for (int i = 0; i < values.Length; i++)                            
            for (int i2 = 0; i2 < values.Length; i2++)
                if (i2 != i && Math.Abs(values[i] - values[i2]) < precision) counter[i]++;            

        for (int i = 0; i < values.Length; i++)    
           if (Math.Abs(values[i] - values[counter.IndexOf(counter.Max())]) < precision) 
               temp.Add(dict.FirstOrDefault(kv => kv.Value == values[i]).Key, values[i]);

        return temp;
    }

使用示例:

static void Main()
{
        Dictionary<string, float> heights = new Dictionary<string, float>()
        {

            {"first", 61.456f},
            {"second", 80.567f},
            {"third", 62.456f},
            {"4", 59.988f},
            {"5", 90.34f},
            {"6", 82.123f}                
        };

        // returns max sequence of elements with difference less than 3f
        var newDict = FindRange(heights, 3f);

        foreach (var item in newDict)
        {
            Console.WriteLine(item.Key + "   "  + item.Value);
        }
}

输出:

first 61,456
third 62,456
4     59,988

答案 2 :(得分:0)

类似的东西:

<script src="X_version1.js"></script>