# 944. Delete Columns to Make Sorted

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 = ["abcdef","uvwxyz"]` and deletion indices `{0, 2, 3}`, then the final array after deletions is `["bef", "vyz"]`, and the remaining columns of `A` are `["b","v"]``["e","y"]`, and `["f","z"]`.  (Formally, the `c`-th column is `[A[0][c], A[1][c], ..., A[A.length-1][c]]`).

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

Return the minimum possible value of `D.length`.

Example 1:

``````Input: A = ["cba","daf","ghi"]
Output: 1
Explanation:
After choosing D = {1}, each column ["c","d","g"] and ["a","f","i"] are in non-decreasing sorted order.
If we chose D = {}, then a column ["b","a","h"] would not be in non-decreasing sorted order.
``````

Example 2:

``````Input: A = ["a","b"]
Output: 0
Explanation: D = {}
``````

Example 3:

``````Input: A = ["zyx","wvu","tsr"]
Output: 3
Explanation: D = {0, 1, 2}
``````

Constraints:

• `1 <= A.length <= 100`
• `1 <= A[i].length <= 1000`

``````class Solution {
public:
int minDeletionSize(vector<string>& A) {
int n = A.size(), len = A[0].size(), res = 0;
for (int j = 0; j < len; ++j) {
for (int i = 0; i < n - 1; ++i) {
if (A[i][j] <= A[i + 1][j]) continue;
++res;
break;
}
}
return res;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/944

https://leetcode.com/problems/delete-columns-to-make-sorted/

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation