Leetcode 1002. Find Common Characters

Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including duplicates).  For example, if a character occurs 3 times in all strings but not 4 times, you need to include that character three times in the final answer.

You may return the answer in any order.

 

Example 1:

Input: ["bella","label","roller"]
Output: ["e","l","l"]

Example 2:

Input: ["cool","lock","cook"]
Output: ["c","o"]

 

Note:

1. 1 <= A.length <= 100
2. 1 <= A[i].length <= 100
3. A[i][j] is a lowercase letter

写得不好，有待优化 

public List<String> commonChars(String[] A) {
        List<Map<Character, Integer>> charmapList = new ArrayList<>();
        List<String> res = new ArrayList<>();
        Set<Character> charSet = new HashSet<>();
        for (int i = 0, length = A.length; i < length; i++) {
            Map<Character, Integer> charMap = new HashMap<>();
            for (int j = 0; j < A[i].length(); j++) {
                char currChar = A[i].charAt(j);
                charSet.add(currChar);
                charMap.put(currChar, charMap.getOrDefault(currChar, 0)+1);
            }
            charmapList.add(charMap);
        }

        label:for (Character c: charSet) {
            int times = Integer.MAX_VALUE;
            for (Map<Character, Integer> map : charmapList){
                Integer time = map.get(c);
                if (time != null && time > 0) {
                    times = Math.min(times, time);
                } else {
                    continue label;
                }
            }
            for (int i = 0; i < times; i++) {
                res.add(c.toString());
            }
        }
        return res;
    }