Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- bool areSimilar(vector<vector<int>>& mat, int k) {
- int m = mat.size();
- int n = mat[0].size();
- std::vector<std::vector<int>> original = mat;
- for (int i = 0; i < m; ++i) {
- if (i % 2 == 0) {
- rotate(mat[i].begin(), mat[i].begin() + k % n, mat[i].end());
- } else {
- rotate(mat[i].rbegin(), mat[i].rbegin() + k % n, mat[i].rend());
- }
- }
- return mat == original;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment