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

 

题目理解:

给定一组字符串,找到出现在所有字符串里面的字符,包含重复的字符

解题思路:

记录所有字母出现在各个字符串里面的最小次数

class Solution {
    public List<String> commonChars(String[] A) {
        int[] record = new int[26];
        Arrays.fill(record, -1);
        for(String str : A){
            int[] local = new int[26];
            for(char ch : str.toCharArray()){
                local[ch - 'a']++;
            }
            for(int i = 0; i < 26; i++){
                if(record[i] == -1 || record[i] > local[i])
                    record[i] = local[i];
            }
        }
        List<String> list = new ArrayList<>();
        for(int i = 0; i < 26; i++){
            while(record[i]-- > 0){
                list.add(String.valueOf((char)('a' + i)));
            }
        }
        return list;
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值