力扣题:字符的统计-11.27

力扣题-11.27

[力扣刷题攻略] Re:从零开始的力扣刷题生活

力扣题1:389. 找不同

解题思想:直接遍历统计即可
力扣题:字符的统计-11.27_第1张图片

class Solution(object):
    def findTheDifference(self, s, t):
        """
        :type s: str
        :type t: str
        :rtype: str
        """
        char_count = {}
        for i in range(len(s)):
            if s[i] in char_count:
                char_count[s[i]] += 1
            else:
                char_count[s[i]] = 1
        for i in range(len(t)):
            if t[i] in char_count:
                char_count[t[i]] -= 1
                if char_count[t[i]]<0:
                    return t[i]
            else:
                return t[i]
class Solution {
public:
    char findTheDifference(string s, string t) {
        std::unordered_map<char, int> char_count;
        for (char c : s) {
            if (char_count.find(c) != char_count.end()) {
                char_count[c] += 1;
            } else {
                char_count[c] = 1;
            }
        }
        for (char c : t) {
            if (char_count.find(c) != char_count.end()) {
                char_count[c] -= 1;
                if (char_count[c] < 0) {
                    return c;
                }
            } else {
                return c;
            }
        }
        return '\0';
    }
};

你可能感兴趣的:(leetcode,java,算法)