389. Find the Difference （hash&异或）

来源：互联网发布：五金行业erp软件报价编辑：程序博客网时间：2024/06/06 14:47

https://leetcode.com/problems/find-the-difference/discuss/

题目：求新增加的字母

解法一：直接统计

class Solution {public:    char findTheDifference(string s, string t) {        int diff[26]={0};        for(int x=0;x<s.length();x++)            diff[s[x]-'a']++,diff[t[x]-'a']--;            diff[t[t.length()-1]-'a']--;        for(int x=0;x<26;x++)            if(diff[x])                 return 'a'+x;    }};

解法二：异或

class Solution {public:    char findTheDifference(string s, string t) {        int diff=0;        for(int x=0;x<s.length();x++)            diff^=(s[x]-'a'),diff^=(t[x]-'a');            diff^=(t[t.length()-1]-'a');        return 'a'+diff;    }};或class Solution {public:    char findTheDifference(string s, string t) {        char diff=0;        for(int x=0;x<s.length();x++)            diff^=s[x],diff^=t[x];            diff^=t[t.length()-1];        return diff;    }};

阅读全文

0 0