牛客编程巅峰赛S1第7场 - 青铜&白银 数组元素交换

class Solution {
public:
    /**
     *
     * @param a int整型vector 原始数组a
     * @param n int整型 第n大
     * @param m int整型 第m大
     * @return int整型vector
     */
    vector<int> sovle(vector<int>& a, int n, int m) {
        // write code here
        vector<int> b;
        for (int i = 0;i < a.size();i++)
        {
            b.push_back(a[i]);
        }
        sort(b.begin(), b.end());
        reverse(b.begin(), b.end());

        int mm = b[m - 1], nn = b[n - 1];

        for (int i = 0;i < a.size();i++)
        {
            if (mm == a[i])
            {
                a[i] = nn;
                continue;
            }
            else if (nn == a[i])
            {
                a[i] = mm;
                continue;
            }
        }
        return a;
    }
};