Determine Whether Matrix Can Be Obtained By Rotation

给两个nxn矩阵, 问是否能通过连续翻转90度得到另一个矩阵.

class Solution {
public:
    bool findRotation(vector<vector<int>>& m, vector<vector<int>>& t) {
        bool one = true;
        bool two = true;
        bool three = true;
        bool four = true;
        int n = m.size();
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                if(m[i][j] != t[i][j]) // orignal
                    one = false;
                if(m[i][j] != t[n - 1 - j][i]) // 90
                    two = false;
                if(m[i][j] != t[n - 1 - i][n - 1 - j]) // 180
                    three = false;
                if(m[i][j] != t[j][n - 1 - i])// 270
                    four = false;
            }
        }
        return one || two || three || four;
    } 
};