Levenshtein Distance算法
摘要：
优化空间复杂度由O(mn)到O(min(n,m))。function levenshtein(s, t){ if (s === t){ return 0; } var m = s.length, n = t.length; if (!m || !n){ return Math.max(m,n); } if (m < n){ var tmp = s; s = t; t = tmp; tmp = m; m = n; n = tmp; tmp = null; } var d = [], i,j; for (j = 0; j <= n; j++){ d[j] = j; } var pre, 阅读全文
posted @ 2011-07-11 17:12 狄烁STEC 阅读(387) 评论(0) 推荐(0) 编辑