[LeetCode] 944. Delete Columns to Make Sorted

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

题目

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

题目大意

这题有点迷，是middle ，但做起来很容易。
字符串数组 A 中的每个字符串元素的长度相同，统计index个数，这个index 的要求是 A[i].charAt(index)，i=0,1,2,3,4 组成的 字符序列 不是严格递增。

思路

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