leetcode 645.Set Mismatch

水题 给一个大小为n的无序数组 问从1-n哪个元素出现了两次 哪个元素没出现

bool vis[10005];
vector<int> findErrorNums(vector<int>& nums) {
	vector<int> ret;
	ret.clear();
	int n = nums.size();
	for (int i = 1; i <= n; i++) vis[i] = false;
	for (int i = 0; i < n; i++)
	{
		if (vis[nums[i]]) ret.push_back(nums[i]);
		vis[nums[i]] = true;
	}
	for (int i = 1; i <= n; i++)
	{
		if (!vis[i]) ret.push_back(i);
	}
	return ret;
}