From 0d11ff82fb91e19a31536a90c0a8c2fcec8f96ca Mon Sep 17 00:00:00 2001 From: jevons0411 Date: Wed, 14 Sep 2022 11:27:57 +0800 Subject: [PATCH] Update SrcJySet.js --- SrcJySet.js | 24 ++++++++++++------------ 1 file changed, 12 insertions(+), 12 deletions(-) diff --git a/SrcJySet.js b/SrcJySet.js index 8de1dcbd..967ece82 100644 --- a/SrcJySet.js +++ b/SrcJySet.js @@ -1282,11 +1282,11 @@ function similar(s, t, f) {//判断两个字符串之间的相似度 if(s === t){ return 100; } - var l = s.length > t.length ? s.length : t.length - var n = s.length - var m = t.length - var d = [] - f = f || 2 + var l = s.length > t.length ? s.length : t.length; + var n = s.length; + var m = t.length; + var d = []; + f = f || 2; var min = function (a, b, c) { return a < b ? (a < c ? a : c) : (b < c ? b : c) } @@ -1294,11 +1294,11 @@ function similar(s, t, f) {//判断两个字符串之间的相似度 if (n === 0) return m if (m === 0) return n for (i = 0; i <= n; i++) { - d[i] = [] - d[i][0] = i + d[i] = []; + d[i][0] = i; } for (j = 0; j <= m; j++) { - d[0][j] = j + d[0][j] = j; } for (i = 1; i <= n; i++) { si = s.charAt(i - 1) @@ -1309,11 +1309,11 @@ function similar(s, t, f) {//判断两个字符串之间的相似度 } else { cost = 1 } - d[i][j] = min(d[i - 1][j] + 1, d[i][j - 1] + 1, d[i - 1][j - 1] + cost) + d[i][j] = min(d[i - 1][j] + 1, d[i][j - 1] + 1, d[i - 1][j - 1] + cost); } } - let res = (1 - d[n][m] / l) *100 - return res.toFixed(f) + let res = (1 - d[n][m] / l) *100 || 0; + return res.toFixed(f); } function jiekousave(urls,update) { try{ @@ -1343,7 +1343,7 @@ function jiekousave(urls,update) { } function checkitem(item) { - log(item.name+' '+urlname+' '+getSimilarity(item.name,urlname)+'dz>'+similar(item.name,urlname)); + log(item.name+' '+urlname+' '+getSimilarity(item.name,urlname)+' '+similar(item.name,urlname)); return item.url==urlurl||(getSimilarity(item.name,urlname)>75&&urltype=="biubiu"); }