{"id":187,"date":"2025-02-16T16:46:54","date_gmt":"2025-02-16T08:46:54","guid":{"rendered":"https:\/\/blog.zeronely.cn\/?p=187"},"modified":"2025-02-16T16:46:55","modified_gmt":"2025-02-16T08:46:55","slug":"%e5%88%b7%e9%a2%98%e5%91%a8%e8%ae%b0%ef%bc%884%ef%bc%89-%e7%9f%a9%e9%98%b5%e6%80%bb%e7%bb%93","status":"publish","type":"post","link":"https:\/\/blog.zeronely.cn\/index.php\/2025\/02\/16\/%e5%88%b7%e9%a2%98%e5%91%a8%e8%ae%b0%ef%bc%884%ef%bc%89-%e7%9f%a9%e9%98%b5%e6%80%bb%e7%bb%93\/","title":{"rendered":"\u5237\u9898\u5468\u8bb0\uff084\uff09\u2014\u2014\u77e9\u9635\u603b\u7ed3"},"content":{"rendered":"\n<p>\u672c\u5468\u5b8c\u6210\u4e86leetcode\u70ed\u9898100\u4e2d\u7684\u77e9\u9635\u90e8\u5206\uff0c\u6765\u505a\u4e2a\u603b\u7ed3\u3002<\/p>\n\n\n\n<p>\u603b\u7684\u6765\u8bf4\uff0c\u77e9\u9635\u90e8\u5206\u7684\u9898\u76ee\u5747\u8f83\u4e3a\u7b80\u5355\u3002<\/p>\n\n\n\n<p>\u5217\u51e0\u4e2a\u6211\u5728\u505a\u9898\u8fc7\u7a0b\u4e2d\u4f7f\u7528\u7684\u6280\u5de7\u548c\u53ef\u80fd\u6027\uff1a\u7b2c\u4e00\uff0c\u77e9\u9635\u53ef\u4ee5\u4ece\u5916\u56f4\u4e00\u5c42\u5c42\u5411\u5185\u90e8\u9012\u5f52\uff1b\u7b2c\u4e8c\uff0c\u77e9\u9635\u7684\u6bcf\u4e00\u4e2a\u4f4d\u7f6e\uff0c\u90fd\u53ef\u4ee5\u4f5c\u4e3a\u4e00\u4e2a\u201c\u5b58\u50a8\u201d\uff0c\u4ece\u800c\u53ef\u4ee5\u5c3d\u91cf\u4e0d\u4f7f\u7528\u66f4\u591a\u7684\u7a7a\u95f4\uff0c\u800c\u662f\u5229\u7528\u539f\u5730\u7684\u8fd0\u7b97\uff1b\u7b2c\u4e09\uff0c\u77e9\u9635\u7684\u4e00\u4e9b\u65cb\u8f6c\u53ef\u4ee5\u7b49\u4ef7\u4e8e\u8f6c\u7f6e\u548c\u7ffb\u8f6c\u7b49\u7684\u7ed3\u5408\uff1b\u7b2c\u56db\uff0c\u53ef\u4ee5\u5217\u51fa\u8f6c\u6362\u7684\u5f0f\u5b50\u518d\u5199\u4ee3\u7801\u3002<\/p>\n\n\n\n<p>\u4ee5\u4e0b\u8bb0\u5f55\u51e0\u4e2a\u9898\u76ee\u7684\u4ee3\u7801\u548c\u601d\u8def\uff1a<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>73.\u77e9\u9635\u7f6e\u96f6<\/strong><\/h2>\n\n\n\n<p>\u5229\u7528\u7b2c\u4e00\u884c\u548c\u7b2c\u4e00\u5217\u505a\u5b58\u50a8\uff0c\u518d\u7528\u989d\u5916\u7684o\uff081\uff09\u7a7a\u95f4\u5b58\u50a8\u7b2c\u4e00\u884c\u548c\u7b2c\u4e00\u5217\u7684\u60c5\u51b5\u3002<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    void setZeroes(vector&lt;vector&lt;int>>&amp; matrix) \n    {\n        int m=matrix.size();\n        int n=matrix&#91;0].size();\n        int flag;\n        if(matrix&#91;0]&#91;0]==0)\n        {\n            flag=-3;\n        }\n        else\n        {\n            flag=0;\n            for(int i=1;i&lt;m;i++)\n            {\n                if(matrix&#91;i]&#91;0]==0)\n                {\n                    flag=-1;\n                    break;\n                }\n            }\n            for(int j=1;j&lt;n;j++)\n            {\n                if(matrix&#91;0]&#91;j]==0)\n                {\n                    if(flag==-1) \n                    {\n                        flag=-3;\n                    }\n                    else\n                    {\n                        flag=-2;\n                    }\n                    break;\n                }\n            }\n        }\n        for(int i=1;i&lt;m;i++)\n        {\n            for(int j=1;j&lt;n;j++)\n            {\n                if(matrix&#91;i]&#91;j]==0)\n                {\n                    matrix&#91;i]&#91;0]=0;\n                    matrix&#91;0]&#91;j]=0;\n                }\n            }\n        }\n        for(int i=1;i&lt;m;i++)\n        {\n            if(matrix&#91;i]&#91;0]==0)\n            {\n                for(int j=1;j&lt;n;j++)\n                {\n                    matrix&#91;i]&#91;j]=0;\n                }\n            }\n        }\n        for(int j=1;j&lt;n;j++)\n        {\n            if(matrix&#91;0]&#91;j]==0)\n            {\n                for(int i=1;i&lt;m;i++)\n                {\n                    matrix&#91;i]&#91;j]=0;\n                }\n            }\n        }\n        if(flag==0)\n        {\n            return;\n        }\n        else if(flag==-1)\n        {\n            for(int i=0;i&lt;m;i++)\n            {\n                matrix&#91;i]&#91;0]=0;\n            }\n        }\n        else if(flag==-2)\n        {\n            for(int j=0;j&lt;n;j++)\n            {\n                matrix&#91;0]&#91;j]=0;\n            }\n        }\n        else\n        {\n            for(int i=0;i&lt;m;i++)\n            {\n                matrix&#91;i]&#91;0]=0;\n            }\n            for(int j=0;j&lt;n;j++)\n            {\n                matrix&#91;0]&#91;j]=0;\n            }\n        }\n    }\n};<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">54.\u87ba\u65cb\u77e9\u9635<\/h2>\n\n\n\n<p>\u4ece\u5916\u5411\u5185\u4e00\u5c42\u5c42\u5904\u7406\uff08\u7c7b\u4f3c\u9012\u5f52\u7684\u601d\u8def\uff09<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    vector&lt;int> spiralOrder(vector&lt;vector&lt;int>>&amp; matrix) \n    {\n        int m=matrix.size();\n        int n=matrix&#91;0].size();\n        vector&lt;int> ans;\n        int bh=0;\n        int bl=0;\n        while(m>0&amp;&amp;n>0)\n        {\n            for(int j=bl;j&lt;bl+n;j++)\n            {\n                ans.push_back(matrix&#91;bh]&#91;j]);\n            }\n            if(m==1) break;\n            for(int i=bh+1;i&lt;bh+m;i++)\n            {\n                ans.push_back(matrix&#91;i]&#91;bl+n-1]);\n            }\n            if(n==1) break;\n            for(int j=bl+n-2;j>bl;j--)\n            {\n                ans.push_back(matrix&#91;bh+m-1]&#91;j]);\n            }\n            for(int i=bh+m-1;i>bh;i--)\n            {\n                ans.push_back(matrix&#91;i]&#91;bl]);\n            }\n            m-=2;\n            n-=2;\n            bl++;\n            bh++;\n        }\n        return ans;\n    }\n};<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">48.\u65cb\u8f6c\u56fe\u50cf<\/h2>\n\n\n\n<p>\u53ef\u4ee5\u4e00\u5c42\u5c42\uff0c\u4e5f\u53ef\u4ee5\u5229\u7528\u7ffb\u8f6c\u5b8c\u6210\uff0c\u6216\u8005\u5217\u51fa\u8868\u8fbe\u5f0f\u5b8c\u6210<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    void rotate(vector&lt;vector&lt;int>>&amp; matrix) \n    {\n        int n=matrix.size();\n        int start=0;\n        while(n>=2)\n        {\n            for(int i=0;i&lt;n-1;i++)\n            {\n                int temp;\n                temp=matrix&#91;start]&#91;start+i];\n                matrix&#91;start]&#91;start+i]=matrix&#91;start+n-1-i]&#91;start];\n                matrix&#91;start+n-1-i]&#91;start]=matrix&#91;start+n-1]&#91;start+n-1-i];\n                matrix&#91;start+n-1]&#91;start+n-1-i]=matrix&#91;start+i]&#91;start+n-1];\n                matrix&#91;start+i]&#91;start+n-1]=temp;\n            }\n            \/*for(int i=0;i&lt;matrix.size();i++)\n            {\n                for(int j=0;j&lt;matrix.size();j++)\n                {\n                    cout&lt;&lt;matrix&#91;i]&#91;j]&lt;&lt;\" \";\n                }\n                cout&lt;&lt;endl;\n            }*\/\n            n-=2;\n            start++;\n        }    \n    }\n};<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">240.\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635<\/h2>\n\n\n\n<p>\u89c2\u5bdf\u77e9\u9635\u5185\u90e8\u7684\u987a\u5e8f\u7279\u70b9\uff0c\u6309\u5e8f\u659c\u5411\u51fa\u53d1\uff0c\u4ece\u800c\u8fbe\u5230o\uff08m+n\uff09\u7684\u590d\u6742\u5ea6\u3002<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    bool searchMatrix(vector&lt;vector&lt;int>>&amp; matrix, int target) \n    {\n        int x=0;\n        int y=matrix&#91;0].size()-1;\n        while(x&lt;matrix.size()&amp;&amp;y>=0)\n        {\n            if(matrix&#91;x]&#91;y]>target)\n            {\n                y--;\n            }\n            else if(matrix&#91;x]&#91;y]&lt;target)\n            {\n                x++;\n            }\n            else\n            {\n                return true;\n            }\n        }\n        return false;\n    }\n};<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>\u672c\u5468\u5b8c\u6210\u4e86leetcode\u70ed\u9898100\u4e2d\u7684\u77e9\u9635\u90e8\u5206\uff0c\u6765\u505a\u4e2a\u603b\u7ed3\u3002 \u603b\u7684\u6765\u8bf4\uff0c\u77e9\u9635\u90e8\u5206\u7684\u9898\u76ee\u5747\u8f83\u4e3a\u7b80\u5355\u3002 \u5217\u51e0\u4e2a\u6211 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[10],"tags":[],"class_list":["post-187","post","type-post","status-publish","format-standard","hentry","category-leetcode"],"_links":{"self":[{"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/posts\/187","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/comments?post=187"}],"version-history":[{"count":1,"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/posts\/187\/revisions"}],"predecessor-version":[{"id":188,"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/posts\/187\/revisions\/188"}],"wp:attachment":[{"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/media?parent=187"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/categories?post=187"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.zeronely.cn\/index.php\/wp-json\/wp\/v2\/tags?post=187"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}