{"id":8537,"date":"2021-08-08T20:22:13","date_gmt":"2021-08-09T03:22:13","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8537"},"modified":"2021-08-08T20:22:56","modified_gmt":"2021-08-09T03:22:56","slug":"leetcode-1886-determine-whether-matrix-can-be-obtained-by-rotation","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/simulation\/leetcode-1886-determine-whether-matrix-can-be-obtained-by-rotation\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1886. Determine Whether Matrix Can Be Obtained By Rotation"},"content":{"rendered":"\n

Given two n x n<\/code> binary matrices mat<\/code> and target<\/code>, return true<\/code> if it is possible to make <\/em>mat<\/code> equal to <\/em>target<\/code> by rotating<\/strong> <\/em>mat<\/code> in 90-degree increments<\/strong>, or <\/em>false<\/code> otherwise.<\/em><\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> mat = [[0,1],[1,0]], target = [[1,0],[0,1]]\nOutput:<\/strong> true\nExplanation: <\/strong>We can rotate mat 90 degrees clockwise to make mat equal target.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> mat = [[0,1],[1,1]], target = [[1,0],[0,1]]\nOutput:<\/strong> false\nExplanation:<\/strong> It is impossible to make mat equal to target by rotating mat.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> mat = [[0,0,0],[0,1,0],[1,1,1]], target = [[1,1,1],[0,1,0],[0,0,0]]\nOutput:<\/strong> true\nExplanation: <\/strong>We can rotate mat 90 degrees clockwise two times to make mat equal target.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • n == mat.length == target.length<\/code><\/li>
  • n == mat[i].length == target[i].length<\/code><\/li>
  • 1 <= n <= 10<\/code><\/li>
  • mat[i][j]<\/code> and target[i][j]<\/code> are either 0<\/code> or 1<\/code>.<\/li><\/ul>\n\n\n\n
    Solution: Simulation<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n2<\/sup>)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  bool findRotation(vector>& mat, vector>& target) {    \n    const int n = mat.size();\n    auto rot = [n](vector>& mat) {      \n      for (int i = 0; i < n; ++i)\n        for (int j = i; j < n; ++j)\n          swap(mat[i][j], mat[j][i]);\n      for (int j = 0; j < n; j++)\n        for (int i = 0; i < n \/ 2; ++i)\n          swap(mat[i][j], mat[n - i - 1][j]);\n      return mat;\n    };\n    for (int i = 0; i < 4; ++i)\n      if (rot(mat) == target) return true;    \n    return false;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given two n x n binary matrices mat and target, return true if it is possible to make mat equal to target by rotating mat in 90-degree increments, or false otherwise. Example 1: Input: mat = [[0,1],[1,0]], target = [[1,0],[0,1]] Output: true…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[48],"tags":[222,718,216,367,179],"class_list":["post-8537","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-easy","tag-inplace","tag-matrix","tag-rotation","tag-simulation","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8537","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8537"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8537\/revisions"}],"predecessor-version":[{"id":8539,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8537\/revisions\/8539"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8537"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8537"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8537"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}