LeetCode 简单操作 | 389. Find the Difference

最新推荐文章于 2024-07-19 19:25:43 发布

rical730

最新推荐文章于 2024-07-19 19:25:43 发布

阅读量235

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/rical730/article/details/59485749

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

/*
 * Leetcode389. Find the Difference
 * Funtion: Given two strings s and t which consist of only lowercase letters.
            String t is generated by random shuffling string s and then add one more letter at a random position.
            Find the letter that was added in t.
 * Example: Input:
            s = "abcd"
            t = "abcde"
            Output:e
 * Author: LKJ
 * Date: 2017/3/01
 * Hint:
*/
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

class Solution {
public:
    char findTheDifference(string s, string t) {
        char res = 0;
        for(int i = 0; i< s.length(); i++){
            res ^= s[i];
        }
        for(int i = 0; i< t.length(); i++){
            res ^= t[i];
        }
        return res;
    }
};



int main(){
    //int myarr[7] = {9, 9, 9, 9, 9, 9, 9};
    //vector<int> myin(myarr,myarr+7);
    string myin = "abc";
    string myin1 = "abce";
    char myout;
    Solution SA;

    //cout << "Please Enter" << endl;
    //cin >> myin >> myin1;
    myout = SA.findTheDifference(myin,myin1);
    cout << myout << endl;

//    cout<<"VecOUT:"<<myout.size()<<endl;
//    for(unsigned int i = 0; i < myout.size(); i++){
//        for(vector<int>::iterator itt = myout[i].begin() ;itt!=myout[i].end(); itt++){
//            cout<<*itt<<"     ";
//        }
//        cout<<endl;
//    }
//    cout<<endl;

//    cout<<"VecOUT:"<<endl;
//    for(vector<int>::iterator it = myout.begin() ;it!=myout.end();it++){
//        cout<<*it<<"     ";
//    }
//    cout<<endl;

    return 0;
}