944. Delete Columns to Make Sorted

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: [“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”,“b”]
Output: 0
Explanation: D = {}

Example 3:
Input: [“zyx”,“wvu”,“tsr”]
Output: 3
Explanation: D = {0, 1, 2}

Note:
1 <= A.length <= 100
1 <= A[i].length <= 1000

题目描述：
给定一个由 N个小写字母组成的字符串数组 A，该数组 A中的每一个字符串长度都相等，现要求选取一组（一个或多个）下标，满足：针对每一个A 中的字符串，删除该下标对应的字母后，要求剩余的字符串中的每一列都是非递减（相等或递增），返回满足所有要求的最小删除下标个数。

思路分析：
Example：
[ c b a
d a f
g h i ]
要求满足剩余的每一列都为非递减，则至少要删除 {b, a, h}所在的列，即 D={1}.

代码：

class Solution {
    public int minDeletionSize(String[] A) {
        int ans = 0;
        for(int i = 0; i < A[0].length(); i++){
        	for(int j = 0; j < A.length - 1; j++){
        		if(A[j].charAt(i) > A[j + 1].charAt(i)){
        			ans++;
        			break;
				}
        	}
        }
        return ans;
    }
}