problem 645. Set Mismatch 题意: solution1: 统计每个数字出现的次数了,然后再遍历次数数组,如果某个数字出现了两次就是重复数,如果出现了0次,就是缺失数. 注意:如何统计每个数字出现的次数: class Solution { public: vector<int> findErrorNums(vector<int>& nums) { vector<, ), cnt(nums.size(), ); ]; ; i<nums.siz…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 Hash方法 直接计算 日期 题目地址: https://leetcode.com/problems/set-mismatch/description/ 题目描述 The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, o…

problem 1021. Remove Outermost Parentheses 参考 1. Leetcode_easy_1021. Remove Outermost Parentheses; 完…

problem 1022. Sum of Root To Leaf Binary Numbers 参考 1. Leetcode_easy_1022. Sum of Root To Leaf Binary Numbers; 完…

problem 1025. Divisor Game 参考 1. Leetcode_easy_1025. Divisor Game; 完…

problem 1029. Two City Scheduling 参考 1. Leetcode_easy_1029. Two City Scheduling; 完…

problem 1030. Matrix Cells in Distance Order 参考 1. Leetcode_easy_1030. Matrix Cells in Distance Order; 完…

problem 1033. Moving Stones Until Consecutive 参考 1. Leetcode_easy_1033. Moving Stones Until Consecutive; 完…

problem 1037. Valid Boomerang 参考 1. Leetcode_easy_1037. Valid Boomerang; 完…

problem 1042. Flower Planting With No Adjacent 参考 1. Leetcode_easy_1042. Flower Planting With No Adjacent; 完…