955. Delete Columns to Make Sorted II

You are given an array of n strings strs, all of the same length.

We may choose any deletion indices, and we delete all the characters in those indices for each string.

For example, if we have strs = [“abcdef”,”uvwxyz”] and deletion indices {0, 2, 3}, then the final array after deletions is [“bef”, “vyz”].

Suppose we chose a set of deletion indices answer such that after deletions, the final array has its elements in lexicographic order (i.e., strs[0] <= strs[1] <= strs[2] <= … <= strs[n - 1]). Return the minimum possible value of answer.length.

class Solution {
public:
    int minDeletionSize(vector<string>& strs) {
        vector<bool> cmp(strs.size(), false);
        int res = 0, len = strs[0].length();
        for(int i = 0; i < len; ++i) {
            int flag = 0;
            list<int> canPass;
            for(int j = 0; j < strs.size() - 1; j++) {
                if(cmp[j]) continue;
                if(strs[j][i] > strs[j + 1][i]) {
                    flag = 1;
                    res++;
                    break;
                } else if(strs[j][i] == strs[j + 1][i]) {
                    for(int k = i + 1; k < len; ++k) {
                        if(strs[j][k] > strs[j + 1][k]) {
                            flag = 2;
                            break;
                        }
                    }
                } else {
                    canPass.push_back(j);
                }
            }
            if(!flag) {
                break;
            } else if(flag == 2) {
                for(auto& pos : canPass)
                    cmp[pos] = true;
            }
        }

        return res;
    }
};