1002. Find Common Characters*

1002. Find Common Characters*

https://leetcode.com/problems/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 <= A.length <= 100
• 1 <= A[i].length <= 100
• A[i][j] is a lowercase letter

C++ 实现 1

对于这样的编程题, 首先不要给自己的脑袋设限, 应尽力用最容易想到的办法解决问题, 再考虑优化. (虽然感觉自己一下子就想到了最优解法 🤣)

首先明确一点, 最后返回的值是 A 中所有字符串所共有的字符, 这说明 A[0] 这个字符串中已经包含了所有需要的结果, 但需要想办法去掉其中其他字符串所不共有的字符. 因此, 第一步就可以统计 A[0] 中的所有字符个数. 之后只需要依次遍历 A 中的其他字符串, 并统计每个字符串的字符个数, 并和 A[0] 相同字符的个数做比较, 取其中的最小值.

class Solution {
public:
    vector<string> commonChars(vector<string>& A) {
        if (A.empty()) return {};
        vector<int> nums(26, 0);
        for (auto &c : A[0]) nums[c - 'a'] ++;
        for (int i = 1; i < A.size(); ++ i) {
            vector<int> records(26, 0);
            // 统计其他字符串的字符个数
            for (auto &c : A[i]) records[c - 'a'] ++;
            // 和 A[0] 进行对比, 共有的字符取个数最少的, 不共有的自然最小值是 0
            for (int i = 0; i < nums.size(); ++ i)
                nums[i] = std::min(nums[i], records[i]);
        }
        vector<string> res;
        // 这里一个容易出错的地方是, C++ 不能直接用 to_string
        // 转换 char... 可以先创建一个空 string, 然后使用 +=.
        for (int i = 0; i < nums.size(); ++ i)
            for (int j = 0; j < nums[i]; ++ j)
                res.push_back(std::string(1, i + 'a'));
        return res;
    }
};