首页 > 代码库 > [leetcode-645-Set Mismatch]
[leetcode-645-Set Mismatch]
The set S
originally contains numbers from 1 to n
. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of one number and loss of another number.
Given an array nums
representing the data status of this set after the error. Your task is to firstly find the number occurs twice and then find the number that is missing. Return them in the form of an array.
Example 1:
Input: nums = [1,2,2,4] Output: [2,3]
Note:
- The given array size will in the range [2, 10000].
- The given array‘s numbers won‘t have any order.
思路:
用一个flag标记nums 中的数字是否出现过。如果出现过说明重复了。
最后再扫描一遍flag数组,如果有false标记说明没有出现过。
vector<int> findErrorNums(vector<int>& nums) { vector<int> ret; vector<bool>flag(nums.size()+1,false); for (int i = 0; i < nums.size();i++) { if (flag[nums[i]] == true)ret.push_back(nums[i]); flag[nums[i]] = true; } for (int i = 1; i < flag.size(); i++) { if (flag[i] == false)ret.push_back(i); } return ret; }
[leetcode-645-Set Mismatch]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。