Leetcode—859.亲密字符串【简单】

news2024/11/26 23:40:52

2023每日刷题（六十三）

Leetcode—859.亲密字符串

在这里插入图片描述

💩山实现代码

class Solution {
public:
    bool buddyStrings(string s, string goal) {
        int len1 = s.size(), len2 = goal.size();
        int cnt = 0;
        int flag = 0;
        int flag2 = 0;
        int odd = -1;
        int a[26] = {0};
        if(len1 != len2) {
            return false;
        }
        for(int i = 0; i < len1; i++) {
            if(s[i] != goal[i]) {
                if(odd != -1 && s[odd] != goal[i] && s[i] != goal[odd]) {
                    return false;
                } 
                if(odd == -1) {
                    odd = i;
                }
                if(s[odd] == goal[i] && s[i] == goal[odd]) {
                    odd = -1;
                }
                cnt++;
            }
            a[s[i] - 'a'] += 1;
            if(a[s[i] - 'a'] >= 2) {
                flag2 = 1;
            }
            if(cnt > 2) {
                return false;
            }
            if(i < len1 && s[i] == s[i + 1]) {
                flag = 1;
            }
        }
        if(cnt == 2 && odd != -1) {
            return false;
        } 
        if(cnt == 2) {
            return true;
        }
        if((flag || flag2)&& cnt == 0) {
            return true;
        }
        return false;
    }
};