左右最值相差最大值、顺时针打印矩阵

class MaxGap {
public:
    int findMaxGap(vector<int> A, int n) {
        // write code here
        int Max = 0;
        for (int i = 0; i < n; i++)
            Max = Max < A[i] ? A[i] : Max;
        int Min = A[0] > A[n - 1] ? A[n -1] : A[0];
        return Max - Min;
    }
};

class Printer {
public:
    vector<int> clockwisePrint(vector<vector<int> > mat, int n, int m) {
        // write code here
       vector<int> ret;
       int x1 = 0, y1 = 0;
       int x2 = n-1, y2 = m-1;
       while(x1 <= x2 && y1 <= y2){
           for(int j = y1; j <= y2; ++j)
               ret.push_back(mat[x1][j]);
           for(int i = x1+1; i < x2; ++i)
               ret.push_back(mat[i][y2]);
           for(int j = y2; x1 < x2 && j >= y1; --j)
               ret.push_back(mat[x2][j]);
           for(int i = x2-1; y1 < y2 && i > x1; --i)
               ret.push_back(mat[i][y1]);
           x1++; y1++;
           x2--; y2--;
       }
       return ret;
    }
};