Javascript通过匹配字符串对数组进行排序 [英] Javascript sort an array by matching to string

问题描述

我有一个包含地理位置代码结果的数组。我想通过与我搜索的术语最接近的匹配对其进行排序。

I have an array containing results form a geolocation code. I want to sort it by the closest match to the term that I have searched.

示例。搜索：披萨。

Array: Pizza Uno, Pizzeria Uno, Burgers and Pizzeria, Cino Pizzeria. 

排序后的数组应为：

Pizza Uno,
Pizzeria Uno,
Burgers and Pizzeria,
Cino Pizzeria. 

感谢您的帮助。

推荐答案

这样的事情怎么样？这是我的第一种获取最接近的颜色名称的方法，具体取决于十六进制颜色。

What about something like this? It was my first approach for getting the closest color name, depending on a hex-color.

当然有一个更好的解决方案，你可以看一下 sift 算法，它比快得多levenshtein的方法。

There's of course a better solution out there, you could for example take a look at the sift algorithm which is really much faster than levenshtein's approach.

然而，这应该可以按预期工作。

However this should work for you as expected.

Array.closest = (function () {
    function levenshtein(s, t) {
        if (!s.length) return t.length;
        if (!t.length) return s.length;

        return Math.min(
            levenshtein((s.substring(1), t) + 1,
            levenshtein((t.substring(1), s) + 1,
            levenshtein((s.substring(1), t.substring(1)) + (s[0] !== t[0] ? 1 : 0)
        );
    }

    return function (arr, str) {
        return arr.sort(function (a, b) {
            return levenshtein((a, str) - levenshtein((b, str);
        });
    };
}());


var arr = ['Pizza Uno', 'Pizzeria Uno', 'Burgers and Pizzeria', 'Cino Pizzeria.'];
Array.closest(arr, 'Pizza') // => ['Pizza Uno', 'Pizzeria Uno', 'Cino Pizzeria.', 'Burgers and Pizzeria'];

这篇关于Javascript通过匹配字符串对数组进行排序的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！