Swift3中的Levenshtein距离

问题描述

我正在使用 Rosetta代码中的教程来计算Levenshtein距离.看来他们的代码在Swift2中，因此我在执行此操作时收到此错误Binary operator '+' cannot be applied to operands of type '[Int]' and 'Repeated<String.CharacterView>':var cur = [i + 2] + empty其中let empty = repeatElement(s, count: 0).我该怎么办?

I'm using a tutorial from Rosetta Code to calculate Levenshtein distance. It seems their code is in Swift2 so I get this error Binary operator '+' cannot be applied to operands of type '[Int]' and 'Repeated<String.CharacterView>' when doing this: var cur = [i + 2] + empty where let empty = repeatElement(s, count: 0). How can I go about this?

推荐答案

需要进行一些更改.

• 数组的构造为空.
• enumerate()现在是enumerated()
• successor()不再存在，所以我将其替换为+1

现在该功能了

快捷键4:

func levDis(_ w1: String, _ w2: String) -> Int {
    let empty = [Int](repeating:0, count: w2.count)
    var last = [Int](0...w2.count)

    for (i, char1) in w1.enumerated() {
        var cur = [i + 1] + empty
        for (j, char2) in w2.enumerated() {
            cur[j + 1] = char1 == char2 ? last[j] : min(last[j], last[j + 1], cur[j]) + 1
        }
        last = cur
    }
    return last.last!
}

快捷键3:

func levDis(w1: String, w2: String) -> Int {

    let (t, s) = (w1.characters, w2.characters)

    let empty = Array<Int>(repeating:0, count: s.count)
    var last = [Int](0...s.count)

    for (i, tLett) in t.enumerated() {
        var cur = [i + 1] + empty
        for (j, sLett) in s.enumerated() {
            cur[j + 1] = tLett == sLett ? last[j] : min(last[j], last[j + 1], cur[j])+1
        }
        last = cur
    }
    return last.last!
}

这篇关于Swift3中的Levenshtein距离的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！