C++ 解法, 执行用时: 1ms, 内存消耗: 492KB, 提交时间: 2017-06-22

class Gloves {
public:
    int findMinimum(int n, vector<int> left, vector<int> right) {
		// write code here
		int a = 0;
		int b = 0;
		int left_min = 26;
		int right_min = 26;
		int out = 0;
		int sum_left = 0;
		int sum_right = 0;
		for (int i = 0; i<n; i++)
		{
			if (left[i] == 0)

				sum_right += right[i];

			else if(right[i]!=0)
			{
				b += right[i];
				right_min = min(right_min, right[i]);

			}
			if (right[i] == 0)
				sum_left += left[i];
			else if(left[i]!=0)
			{
				a += left[i];
				left_min = min(left_min, left[i]);

			}
		}
		if (a - left_min +1 >b - right_min + 1)
		{

			out = b - right_min + 1 + sum_right + sum_left + 1;
		}
		else
		{
			out = a - left_min + 1 + sum_left + sum_right + 1;
		}
		return out;
	}
};

C++ 解法, 执行用时: 1ms, 内存消耗: 496KB, 提交时间: 2017-08-01

class Gloves {
public:
    int findMinimum(int n, vector<int> left, vector<int> right) {
        // write code here
        int sum = 0;
        int lmin = INT_MAX;
        int rmin = INT_MAX;
        int lsum = 0;
        int rsum = 0;
        for (int i = 0; i < n; ++i){
            if (left[i]*right[i] == 0){
                sum += left[i]+right[i];
            }
            else {
                lsum += left[i];
                rsum += right[i];
                lmin = min(lmin,left[i]);
                rmin = min(rmin,right[i]);
            }
        }
        
        sum += min(lsum-lmin+1,rsum-rmin+1)+1;
        
        return sum;
    }
};