Leetcode—859.亲密字符串【简单】Plus（ranges::any_of）

原创已于 2024-05-04 20:57:50 修改 · 572 阅读

8 ·

本内容遵循CC 4.0 BY-SA版权协议

GEO检测

收录于

LeetCode刷题C++

于 2023-12-18 21:26:11 首次发布

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;
    }
};

运行结果

在这里插入图片描述

2024.5.5重温一遍

C++实现代码

class Solution {
public:
    bool buddyStrings(string s, string goal) {
        if(goal.length() != s.length()) {
            return false;
        }
        if(s == goal && moreThanOne(s)) {
            return true;
        }
        vector<int> diff;
        for(int i = 0; i < s.size(); i++) {
            if(s[i] != goal[i]) {
                diff.push_back(i);
            }
        }
        return diff.size() == 2 && s[diff[0]] == goal[diff[1]] && s[diff[1]] == goal[diff[0]];
    }

private:
    bool moreThanOne(string &s) {
        vector<int> v(25);
        for(const char c: s) {
            v[c - 'a']++;
        }
        return ranges::any_of(v, [](int n) { return n > 1; });
    }
};