swift：比较 2 个字符数组，从每个字符中删除一个值

Question

这就是我想要做的。我正在制作一个游戏，对手猜对方的话，每个猜测都有直接和间接的命中。请参阅星号以了解我遇到问题的地方。

var directSum = 0
var indirectSum = 0
var words = ["canon", "cnams"]
var secretWord = Array(words[0].characters)
var guessWord = Array(words[1].characters)
var secretWordInd = [Character]()
var guessWordInd = [Character]()

let dir1 = secretWord[0] == guessWord[0]
let dir2 = secretWord[1] == guessWord[1]
let dir3 = secretWord[2] == guessWord[2]
let dir4 = secretWord[3] == guessWord[3]
let dir5 = secretWord[4] == guessWord[4]


if dir1 && dir2 && dir3 && dir4 && dir5 {
    print ("you won!")
}
    if dir1 {
        directSum += 1
    } else {
        secretWordInd.append(secretWord[0])
        guessWordInd.append(guessWord[0])
}
    if dir2 {
        directSum += 1
    } else {
        secretWordInd.append(secretWord[1])
        guessWordInd.append(guessWord[1])
}
    if dir3 {
        directSum += 1
    } else {
        secretWordInd.append(secretWord[2])
        guessWordInd.append(guessWord[2])
}
    if dir4 {
        directSum += 1
    } else {
        secretWordInd.append(secretWord[3])
        guessWordInd.append(guessWord[3])
}
    if dir5 {
        directSum += 1
    } else {
        secretWordInd.append(secretWord[4])
        guessWordInd.append(guessWord[4])
**}

for var secretLetter in secretWordInd {
    for var guessLetter in guessWordInd{
        if secretLetter == guessLetter {
            secretWordInd.remove(at:secretWordInd.indexOf(secretLetter))
            guessWordInd.remove(at:guessWordInd.indexOf(guessLetter))
            indirectSum += 1
            }
        }
    }**
var score = [directSum, indirectSum]

我需要做的是每次 Array:SecretWordInd 中有一个字符匹配 Array:guessWordInd 中的一个字符时计数，只删除这两个字符（每个字符串一个），每次发生这种情况时，indirectSum += 1 .例如，如果一个中有 2 个“a”，另一个中有 1 个，则该函数需要从每个中删除 1 个 a。 这意味着directSum函数的输出，在这种情况下indirectSum应该是[1,2]，因为猜测词中的一个“n”只有一个间接命中。 这是什么让我的函数变得复杂。两个数组中的值的数量不会是恒定的。我不知道如何使用一种方法来做到这一点（.contains 仅适用于我认为的字符串）。非常感谢您的帮助！谢谢！

Answer 1

您应该在文档中查看 Array、Set 和 String 数据类型，它们提供了许多函数来执行这种计算和转换。

例如：

var secretWord = "canon"
var guessWord  = "cnams"

// identify shared letters using sets
let sharedLetters  = Set(secretWord.characters).intersection(Set(guessWord.characters))

// count number of shared letters present in both words
let sharedCounts   = sharedLetters.map{  c      in (c, secretWord.characters, guessWord.characters) }
                                  .map{ (c,s,g) in (c, s.filter{$0==c}, g.filter{$0==c}) } 
                                  .map{ (c,s,g) in (c, min(s.count,g.count)) }

// count same letters at same position and shared
// (if you're making a mastermind game, you should subtract directCount from indirectCount)                                 
let directCount   = zip(secretWord.characters,guessWord.characters).filter{$0==$1}.count
let indirectCount = sharedCounts.map{$0.1}.reduce(0,+)                                 


// remove shared letters (for count) from both strings
sharedCounts.flatMap{ Array(repeating:$0, count:$1) }
            .forEach{ secretWord.remove(at:secretWord.characters.index(of:$0)!) }
sharedCounts.flatMap{ Array(repeating:$0, count:$1) }
            .forEach{ guessWord.remove(at:guessWord.characters.index(of:$0)!) }


sharedLetters  // {"n", "a", "c"}
sharedCounts   // ("n", 1), ("a",1), ("c", 1)]
directCount    // 1
indirectCount  // 3    
secretWord     // "on"
guessWord      // "ms"

Answer 2

正如其他人所说，这里不是做作业的地方；）

但这里有一些可能有用的提示：

indexOf : 返回您要查找的元素的索引，如果不在集合中，则返回 nil

remove : 从数组中删除