[Swift]LeetCode944. 删除列以使之有序 | Delete Columns to Make Sorted

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9977742.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

We are given an array A of N lowercase letter strings, all of the same length.

Now, we may choose any set of deletion indices, and for each string, we delete all the characters in those indices.

For example, if we have a string "abcdef" and deletion indices {0, 2, 3}, then the final string after deletion is "bef".

Suppose we chose a set of deletion indices D such that after deletions, each remaining column in A is in non-decreasing sorted order.

Formally, the c-th column is [A[0][c], A[1][c], ..., A[A.length-1][c]]

Return the minimum possible value of D.length.

 Example 1:

Input: ["cba","daf","ghi"]
Output: 1

Example 2:

Input: ["a","b"]
Output: 0

Example 3:

Input: ["zyx","wvu","tsr"]
Output: 3

Note:

1. 1 <= A.length <= 100
2. 1 <= A[i].length <= 1000

---

给出由 N 个小写字母串组成的数组 A，所有小写字母串的长度都相同。

现在，我们可以选择任何一组删除索引，对于每个字符串，我们将删除这些索引中的所有字符。

举个例子，如果字符串为 "abcdef"，且删除索引是 {0, 2, 3}，那么删除之后的最终字符串为 "bef"。

假设我们选择了一组删除索引 D，在执行删除操作之后，A 中剩余的每一列都是有序的。

形式上，第 c 列为 [A[0][c], A[1][c], ..., A[A.length-1][c]]

返回 D.length 的最小可能值。

 示例 1：

输入：["cba","daf","ghi"]
输出：1

示例 2：

输入：["a","b"]
输出：0

示例 3：

输入：["zyx","wvu","tsr"]
输出：3

提示：

1. 1 <= A.length <= 100
2. 1 <= A[i].length <= 1000

---

232ms 

class Solution {
  func minDeletionSize(_ A: [String]) -> Int {
    var dl = 0
    var Ab : [[UInt8]] = []
    for var s in A {
      Ab.append(Array<UInt8>(s.utf8))
    }
    for var i in 0..<Ab[0].count {
      for var j in 0..<A.count-1 {
        if Ab[j][i] > Ab[j+1][i] {
          dl += 1
          break
        }
      } 
    }
    return dl
  }
}

---

264ms

class Solution {
    func minDeletionSize(_ A: [String]) -> Int {
        guard A.count > 1 else { return 0 }
        var minSet = Set<Int>()
        for i in 0..<A.count-1 {
            let strArr = Array(A[i])
            let strArr2 = Array(A[i+1])
            for k in 0..<strArr.count {
                if strArr[k] > strArr2[k] {
                    minSet.insert(k)
                }
            }
        }
        return minSet.count
    }
}

---

272ms

class Solution {
    func minDeletionSize(_ A: [String]) -> Int {
        var chars: [[Character]] = []
        chars = A.map { Array($0) }
        let numColumns = A.first!.count
        var count = 0
        for i in 0..<numColumns {
            inner: for j in 1..<chars.count {
                if chars[j][i] < chars[j - 1][i] {
                    count += 1
                    break inner
                }
            }
        }
        return count
    }
}

---

280ms

class Solution {
  func minDeletionSize(_ A: [String]) -> Int {
    var deleteCount = 0
    
    var arr = [[Character]]()
    for i in 0..<A.count {
      arr.append(Array(A[i]))
    }
    
    for i in 0..<arr[0].count {
      for j in 1..<arr.count {
        if arr[j-1][i] > arr[j][i] {
          deleteCount += 1
          break
        }
      }
    }
    return deleteCount
  }
}

---

384ms

class Solution {
    func minDeletionSize(_ A: [String]) -> Int {
       var d_size = [Int]()
    for index_a in A.indices {
        if (index_a+1) < A.count {
            let a_s1 = Array(A[index_a])
            let a_s2 = Array(A[index_a+1])
            for s_i in 0..<a_s1.count {
                if String(a_s1[s_i]) > String(a_s2[s_i]) && !d_size.contains(s_i)  {
                    d_size.append(s_i)
                }
            }
        }
        
    }
    return d_size.count 
    }
}