class Solution {
public:
int minDeletionSize(vector<string>& A) {
int ans = 0;
int n = A.size(), m = A[0].size();
for(int i = 0; i < m; i++){
for(int j = 0; j < n - 1; j++){
if(A[j][i] > A[j+1][i]){
ans ++;
break;
}
}
}
return ans;
}
};
leetcode 944. 删列造序
最新推荐文章于 2022-05-12 22:20:07 发布