【Leetcode_easy】859. Buddy Strings

problem

859. Buddy Strings

solution:

class Solution {
public:
    bool buddyStrings(string A, string B) {
        if(A.size()!=B.size()) return false;
        if(A==B && unordered_set<char>(A.begin(), A.end()).size()<A.size()) return true;
        vector<int> diff;
        for(int i=0; i<A.size(); ++i)
        {
            if(A[i]!=B[i]) diff.push_back(i);
        }
        return diff.size()==2 && A[diff[0]]==B[diff[1]] && A[diff[1]]==B[diff[0]];
    }
};

参考

1. Leetcode_easy_859. Buddy Strings;

2. grandyang;

3. Discuss;

完