解题思路:
遍历每一列进行判断即可,代码如下:
class Solution {
public:
int minDeletionSize(vector<string>& strs) {
int res = 0;
int row = strs.size(), col = strs[0].size();
for(int j = 0; j < col; j ++) {
for(int i = 0; i < row - 1; i ++) {
if(strs[i][j] > strs[i + 1][j]) {
res ++;
break;
}
}
}
return res;
}
};