2021.3.8做题记录

628. 三个数的最大乘积

class Solution {
public:
    int maximumProduct(vector<int>& nums) {
sort(nums.begin(), nums.end());
        int n = nums.size();
        return max(nums[0] * nums[1] * nums[n - 1], nums[n - 3] * nums[n - 2] * nums[n - 1]);
    }
};

645. 错误的集合

class Solution {
public:
    vector<int> findErrorNums(vector<int>& nums) {
	int tem;
	for (int i = 0; i < nums.size(); i++)
	{
		tem=nums[i];
		if (nums[i] != j)//顺序排列数组
			swap(nums[i] ,nums[nums[i]-1]);
		if (nums[i] == tem)
			i++;
		else
			i++;
		int j = 0;
		for (int m = 0; m < nums.size(); m++)
		{
			j++;
			if (nums[m] != j)
				return { nums[m],j };
		}
	}
	return nums;
   }
};