A  simple java solution faster than 98.23%[Accepted][Runtime: 1 ms]
```\nimport java.util.*;\n\nclass Solution {\n    public int minDeletionSize(String[] A) {\n        int[] map=new int[A.length];\n        int mask=0;\n        i
```\nimport java.util.*;\n\nclass Solution {\n    public int minDeletionSize(String[] A) {\n        int[] map=new int[A.length];\n        int mask=0;\n        int cnt=0;\n        int flag=0;\n        for(int i=0;i<A[0].length();i++){\n            int j=1;\n            for(;j<A.length;j++){\n                if(A[j].charAt(i)<A[j-1].charAt(i)){\n                    if(mask==0||map[j]==map[j-1]){\n                        cnt++;\n                        break;\n                    }\n                }\n            }\n            if(j==A.length){\n                for(int k=0;k<A.length;k++){\n                    map[k]=map[k]*26+A[k].charAt(i)-\'a\';\n                    mask=1;\n                    if(k>0&& map[k]==map[k-1]){\n                        flag=1;\n                    }\n                }\n                if(flag!=1){\n                    return cnt;\n                }\n            }\n        }\n        return cnt;\n    }\n}\n````
[]