365天挑战LeetCode1000题——Day 101 重新格式化电话号码喧闹和富有所有可能的真二叉树

最新推荐文章于 2024-09-14 20:30:05 发布

ShowM3TheCode

最新推荐文章于 2024-09-14 20:30:05 发布

阅读量223

点赞数

分类专栏： LeetCode千题之路文章标签：算法 leetcode 动态规划

本文链接：https://blog.csdn.net/ShowMeTheCod3/article/details/127132417

版权

LeetCode千题之路专栏收录该内容

124 篇文章 1 订阅

订阅专栏

1694. 重新格式化电话号码

在这里插入图片描述

代码实现（模拟）

class Solution {
public:
    string reformatNumber(string number) {
        vector<string> tokens;
        string processedNumber = "";
        int pos = 0;
        while (pos != number.size()) {
            string token = "";
            for (int i = 0; i < 3; i++) {
                if (pos == number.size()) break;
                if (number[pos] != ' ' && number[pos] != '-') {
                    token += number[pos];
                }
                else {
                    i--;
                }
                pos++;
            }
            tokens.push_back(token);
        }
        // for (auto t : tokens) cout << t << " ";
        if (tokens.back().size() == 0) tokens.pop_back();
        if (tokens.back().size() == 1) {
            char tmp = tokens[tokens.size() - 2][2];
            tokens[tokens.size() - 2] = tokens[tokens.size() - 2].substr(0, 2);
            tokens.back() = tmp + tokens.back();
        }
        processedNumber = tokens[0];
        for (int i = 1; i < tokens.size(); i++) {
            processedNumber += '-' + tokens[i];
        }
        return processedNumber;
    }
};

851. 喧闹和富有

在这里插入图片描述

代码实现（BFS）

class Solution {
public:
    vector<int> loudAndRich(vector<vector<int>>& richer, vector<int>& quiet) {
        int n = quiet.size();
        vector<int> answer(n);
        for (int i = 0; i < n; i++) answer[i] = i;
        unordered_map<int, vector<int>> richerMap;
        for (auto arr : richer) {
            richerMap[arr[1]].push_back(arr[0]);
        }
        for (int i = 0; i < n; i++) {
            queue<int> myQueue;
            for (auto father : richerMap[i]) {
                myQueue.push(father);
            }
            while (!myQueue.empty()) {
                auto father = myQueue.front();
                myQueue.pop();
                if (answer[father] != father) {
                    if (quiet[answer[father]] < quiet[answer[i]]) answer[i] = answer[father];
                    continue;
                }
                if (quiet[father] < quiet[answer[i]]) answer[i] = father;
                for (auto nexFather : richerMap[father]) {
                    myQueue.push(nexFather);
                }
            }
        }
        return answer;
    }
};

894. 所有可能的真二叉树

在这里插入图片描述

代码实现（dp）

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<TreeNode*> allPossibleFBT(int n) {
        vector<TreeNode*> answer;
        if (n == 1) {
            TreeNode* root = new TreeNode(0);
            answer.push_back(root);
            return answer;
        }
        if (n & 1 == 0) return answer;
        for (int i = 1; i <= n - 2; i += 2) {
            vector<TreeNode*> left = allPossibleFBT(i);
            vector<TreeNode*> right = allPossibleFBT(n - 1 - i);
            for (int j = 0; j < left.size(); j++) {
                for (int k = 0; k < right.size(); k++) {
                    TreeNode* root = new TreeNode(0);
                    root->left = left[j];
                    root->right = right[k];
                    answer.push_back(root);
                }
            }
        }
        return answer;
    }
};