[Swift]LeetCode960. 删列造序 III | Delete Columns to Make Sorted III

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

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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 an array A = ["babca","bbazb"] and deletion indices {0, 1, 4}, then the final array after deletions is ["bc","az"].

Suppose we chose a set of deletion indices D such that after deletions, the final array has every element (row) in lexicographic order.

For clarity, A[0] is in lexicographic order (ie. A[0][0] <= A[0][1] <= ... <= A[0][A[0].length - 1]), A[1] is in lexicographic order (ie. A[1][0] <= A[1][1] <= ... <= A[1][A[1].length - 1]), and so on.

Return the minimum possible value of D.length.

Example 1:

Input: ["babca","bbazb"]
Output: 3
Explanation: After deleting columns 0, 1, and 4, the final array is A = ["bc", "az"].
Both these rows are individually in lexicographic order (ie. A[0][0] <= A[0][1] and A[1][0] <= A[1][1]).
Note that A[0] > A[1] - the array A isn't necessarily in lexicographic order.

Example 2:

Input: ["edcba"]
Output: 4
Explanation: If we delete less than 4 columns, the only row won't be lexicographically sorted.

Example 3:

Input: ["ghi","def","abc"]
Output: 0
Explanation: All rows are already lexicographically sorted.

Note:

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

---

给定由 N 个小写字母字符串组成的数组 A，其中每个字符串长度相等。

选取一个删除索引序列，对于 A 中的每个字符串，删除对应每个索引处的字符。

比如，有 A = ["babca","bbazb"]，删除索引序列 {0, 1, 4}，删除后 A 为["bc","az"]。

假设，我们选择了一组删除索引 D，那么在执行删除操作之后，最终得到的数组的行中的每个元素都是按字典序排列的。

清楚起见，A[0] 是按字典序排列的（即，A[0][0] <= A[0][1] <= ... <= A[0][A[0].length - 1]），A[1] 是按字典序排列的（即，A[1][0] <= A[1][1] <= ... <= A[1][A[1].length - 1]），依此类推。

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

示例 1：

输入：["babca","bbazb"]
输出：3
解释：
删除 0、1 和 4 这三列后，最终得到的数组是 A = ["bc", "az"]。
这两行是分别按字典序排列的（即，A[0][0] <= A[0][1] 且 A[1][0] <= A[1][1]）。
注意，A[0] > A[1] —— 数组 A 不一定是按字典序排列的。

示例 2：

输入：["edcba"]
输出：4
解释：如果删除的列少于 4 列，则剩下的行都不会按字典序排列。

示例 3：

输入：["ghi","def","abc"]
输出：0
解释：所有行都已按字典序排列。

提示：

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

---

108ms

class Solution {
    func minDeletionSize(_ A: [String]) -> Int {
        let n = A.count
        if (n == 0) {
            return 0
        }
        let m = A.first!.count
        if (m == 0) {
            return 0
        }
        
        let Chars = A.map{Array<UInt8>($0.utf8)}
        
        var compare = Array<Array<Bool>>(repeating: Array<Bool>(repeating: false, count: m), count: m)
        for i in 0..<m {
            one: for j in i+1..<m {
                for l in 0..<n {
                    if Chars[l][i] > Chars[l][j] {
                        continue one
                    }
                }
                compare[i][j] = true
            }
        }
        
        var f :[Int] = Array<Int>(repeating: 0, count: m)
        
        var i = m - 2;
        while  i >= 0 {
            var max = 0
            for j in i+1..<m {
                let tempMax = (compare[i][j] ? (1 + f[j]): 0)
                if (tempMax > max) {
                    max = tempMax
                }
            }
            f[i] = max
            i -= 1
        }
        var max = 0
        for fe in f {
            if max < fe {
                max = fe
            }
        }
        return m - (max + 1)
    }
}

---

160ms

class Solution {
    func minDeletionSize(_ A: [String]) -> Int {
    let count = A[0].count
    guard count > 1 else { return 0 }
    
    let chars: [[Character]] = A.map { Array($0) }
    var dp = [Int](repeating: 1, count: count)
    
    for r in 1..<count {
        var longest = 0
        
        next: for l in 0..<r {
            for row in chars {
                if row[l] > row[r] {
                    continue next
                }
            }
            if dp[l] > longest {
                longest = dp[l]
            }
        }
        
        dp[r] = longest + 1
    }
    return count - dp.max()!
}
}

---

512ms

class Solution {
    func minDeletionSize(_ A: [String]) -> Int {
        var A = A
        var n:Int = A.count
        var m:Int = A[0].count
        var f:[Int] = [Int](repeating:0,count:102)
        var maxd = -1
        for i in 0..<m
        {
            f[i] = 1
            for j in 0..<i
            {
                if smaller(j, i, &A, n)
                {
                    f[i] = max(f[i], f[j] + 1)
                }
            }
            maxd = max(maxd, f[i])
        }
        return m - maxd
    }
    
    func smaller(_ i:Int,_ j:Int,_ A:inout [String],_ n:Int) -> Bool
    {
        for k in 0..<n
        {
            if A[k][i] > A[k][j]
            {
                return false
            }
        }
        return true
    }
}

extension String {        
    //subscript函数可以检索数组中的值
    //直接按照索引方式截取指定索引的字符
    subscript (_ i: Int) -> Character {
        //读取字符
        get {return self[index(startIndex, offsetBy: i)]}
    }
}

---

1488ms

class Solution {
    func minDeletionSize(_ A: [String]) -> Int {
        let count = A[0].count
    guard count > 1 else { return 0 }
    
    var dp = [Int](repeating: 1, count: count)
    
    for r in 1..<count {
        var longest = 0
        
        next: for l in 0..<r {
            for row in A {
                let chars = Array(row)
                if chars[l] > chars[r]{
                    continue next
                }
            }
            if dp[l] > longest {
                longest = dp[l]
            }
        }
        
        dp[r] = longest + 1
    }
    
    return count - dp.max()!
    }
}