zoukankan      html  css  js  c++  java
  • [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;
        }
    }
  • 相关阅读:
    构建之法阅读笔记04
    学习进度条10
    描绘用户场景并将典型用户和用户场景描述
    学习进度条09
    构建之法阅读笔记03
    学习进度条08
    每日站立会议10(完成)
    每日站立会议09
    团队成员细节工作项估计
    JS实现全选、不选、反选
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12208573.html
Copyright © 2011-2022 走看看