• [LC] 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"]


    class Solution {
        public List<String> commonChars(String[] A) {
            List<String> res = new ArrayList<>();
            if (A == null || A.length == 0) {
                return res;
            }
            int[] lowerCaseArr = new int[26];
            for (char c: A[0].toCharArray()) {
                lowerCaseArr[c - 'a'] += 1;
            }
            for (int i = 1; i < A.length; i++) {
                int[] curDict = new int[26];
                for (char c: A[i].toCharArray()) {
                    curDict[c - 'a'] += 1;
                }
                for (int j = 0; j < lowerCaseArr.length; j++) {
                    lowerCaseArr[j] = Math.min(lowerCaseArr[j], curDict[j]);
                }
            }
            
            for (int i = 0; i < lowerCaseArr.length; i++) {
                while (lowerCaseArr[i] > 0) {
                    res.add(Character.toString((char)(i + 'a')));
                    lowerCaseArr[i] -= 1;
                }
            }
            return res;
        }
    }
  • 相关阅读:
    java高级语法4:集合
    java高级语法3:异常和注解
    Java高级语法2:Lambda表达式
    VS编译时卡在正在从以下位置加载xxx.dll符号
    mysql中的外键
    localhost和127.0.0.1的区别
    添加依赖项
    代码版本控制——TFS
    优化版冒泡排序
    visual studio vode 汉化
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12208573.html
Copyright © 2020-2023  润新知