c++，faster than 98.95%，less than 94.76%
c++\n// \u5982\u679Cstrs[i - 1][k] == strs[i][k]\u6216\u8005\u5217\u5DF2\u5220\u9664,\u67E5\u627E\u81F3\u7B2C\u4E00\u4E2Astrs[i - 1][k] > strs[i][k]\uFF0C++ret\
```c++\n// \u5982\u679Cstrs[i - 1][k] == strs[i][k]\u6216\u8005\u5217\u5DF2\u5220\u9664,\u67E5\u627E\u81F3\u7B2C\u4E00\u4E2Astrs[i - 1][k] > strs[i][k]\uFF0C++ret\uFF0C\u6807\u8BB0\u5F53\u524D\u5217\u5220\u9664\uFF0C\u56DE\u9000\u5230\u7B2C\u4E00\u5217\n// \u5982\u679Cstrs[i - 1][k] > strs[i][k]\uFF0C++ret\uFF0C\u6807\u8BB0\u5F53\u524D\u5217\u5220\u9664\uFF0C\u56DE\u9000\u5230\u7B2C\u4E00\u5217[\u589E\u52A0\u53CD\u6094\u673A\u5236]\n// \u5982\u679C ret \u65E0\u589E\u52A0\uFF0C\u5219\u8FD4\u56DE\nclass Solution {\npublic:\n    int minDeletionSize(vector<string>& strs) {\n\t\tint m = strs.size();\n\t\tint n = strs[0].size();\n\t\t\n\t\tint ret = 0;\n\t\tvector<bool> flag(n, false);\n\t\tfor (int j = 0; j < n; ++j) {\n\t\t\tif (flag[j]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint temp = ret;\n\t\t\tfor (int i = 1; i < m; ++i) {\n\t\t\t\tint k = j;\n\t\t\t\twhile (k < n && (strs[i - 1][k] == strs[i][k] || flag[k])) {\n\t\t\t\t\t++k;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (k < n && strs[i - 1][k] > strs[i][k]) {\n\t\t\t\t\tflag[k] = true;\n\t\t\t\t\t++ret;\n\t\t\t\t\tj = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\t\n\t\t\t\n\t\t\tif (temp == ret) {\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn ret;\n    }\n};\n```
[]