<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                合規國際互聯網加速 OSASE為企業客戶提供高速穩定SD-WAN國際加速解決方案。 廣告
                ## 問題 你想對兩個或多個字符串進行匹配。 ## 方法 計算編輯距離,即計算把某個字符串轉為另外一個字符串需要操作的次數。 ~~~ Levenshtein = (str1, str2) -> l1 = str1.length l2 = str2.length Math.max l1, l2 if Math.min l1, l2 == 0 i = 0; j = 0; distance = [] for i in [0...l1 + 1] distance[i] = [] distance[i][0] = i distance[0][j] = j for j in [0...l2 + 1] for i in [1...l1 + 1] for j in [1...l2 + 1] distance[i][j] = Math.min distance[i - 1][j] + 1, distance[i][j - 1] + 1, distance[i - 1][j - 1] + if (str1.charAt i - 1) == (str2.charAt j - 1) then 0 else 1 distance[l1][l2] ~~~ ## 詳解 你可以使用Hirschberg或者Wagner-Fischer的算法來計算編輯距離。上例使用的是Wagner-Fischer算法。
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看