leetcode 748. Shortest Completing Word

写的及其丑陋的代码

class Solution {
    public String shortestCompletingWord(String licensePlate, String[] words) {
        licensePlate = licensePlate.toLowerCase();
        int[] arr = new int[26];
        for(int i=0;i<licensePlate.length();i++){
            char tmp = licensePlate.charAt(i);
            if(tmp-'a'>=0 && tmp-'a'<=25){
                arr[tmp-'a'] += 1;
            }
        }
        int min = Integer.MAX_VALUE;
        String res = "";
        for(String s: words){
            if(isCompleted(arr,s)){
                res = s.length()<min?s:res;
                min = Math.min(min,s.length());
            }
        }
        return res;
    }
    public boolean isCompleted(int[] arr,String s){
        int[] arr1 = new int[26];
        s = s.toLowerCase();
        for(int i=0;i<s.length();i++){
            char tmp1 = s.charAt(i);
            if(tmp1-'a'>=0 && tmp1-'a'<=25){
                arr1[tmp1-'a'] += 1;
            }
        }
        for(int i = 0;i<26;i++){
            if(arr[i]>arr1[i]) return false;
        }
        return true;
    }
}