Leetcode 389. Find the Difference | | Leetcode 389. Find the Difference 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution Version 1 123456789101112131415161718class Solution {public: char findTheDifference(string s, string t) { unordered_map<char, int> s_map; unordered_map<char, int> t_map; for(char ch: s) { s_map[ch]++; } for(char ch: t) { t_map[ch]++; } for(auto temp: t_map) { if(s_map[temp.first] < temp.second) { return temp.first; } } }}; Version 2 12345678910111213class Solution {public: char findTheDifference(string s, string t) { char c = 0; for(char ch: s) { c ^= ch; } for(char ch: t) { c ^= ch; } return c; }}; Reference https://leetcode.com/problems/find-the-difference/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏