{"id":657,"date":"2020-06-20T00:09:26","date_gmt":"2020-06-19T16:09:26","guid":{"rendered":"http:\/\/www.guanhaobo.cn\/?p=657"},"modified":"2020-06-20T00:09:26","modified_gmt":"2020-06-19T16:09:26","slug":"jz1-%e4%ba%8c%e7%bb%b4%e6%95%b0%e7%bb%84%e4%b8%ad%e7%9a%84%e6%9f%a5%e6%89%be","status":"publish","type":"post","link":"https:\/\/www.guanhaobo.cn\/?p=657","title":{"rendered":"JZ1 \u2014\t\u4e8c\u7ef4\u6570\u7ec4\u4e2d\u7684\u67e5\u627e"},"content":{"rendered":"

\u9898\u76ee\u63cf\u8ff0<\/h3>\n

\u5728\u4e00\u4e2a\u4e8c\u7ef4\u6570\u7ec4\u4e2d\uff08\u6bcf\u4e2a\u4e00\u7ef4\u6570\u7ec4\u7684\u957f\u5ea6\u76f8\u540c\uff09\uff0c\u6bcf\u4e00\u884c\u90fd\u6309\u7167\u4ece\u5de6\u5230\u53f3\u9012\u589e\u7684\u987a\u5e8f\u6392\u5e8f\uff0c\u6bcf\u4e00\u5217\u90fd\u6309\u7167\u4ece\u4e0a\u5230\u4e0b\u9012\u589e\u7684\u987a\u5e8f\u6392\u5e8f\u3002\u8bf7\u5b8c\u6210\u4e00\u4e2a\u51fd\u6570\uff0c\u8f93\u5165\u8fd9\u6837\u7684\u4e00\u4e2a\u4e8c\u7ef4\u6570\u7ec4\u548c\u4e00\u4e2a\u6574\u6570\uff0c\u5224\u65ad\u6570\u7ec4\u4e2d\u662f\u5426\u542b\u6709\u8be5\u6574\u6570\u3002<\/p>\n

\u89e3\u6cd5\u4e00<\/h3>\n

\u6700\u57fa\u7840\u7684\u89e3\u6cd5\uff0c\u4e24\u91cd\u5faa\u73af\uff0c\u66b4\u529b\u679a\u4e3e\u3002\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(m*n)<\/code><\/p>\n

public class Solution {\n    public boolean Find(int target, int [][] array) {\n        if (array.length == 0 || array[0].length == 0)\n            return false;\n        for (int i = 0; i < array.length; i++)\n            for (int j = 0; j < array[i].length; j++)\n                if (array[i][j] == target)\n                    return true;\n        return false;\n    }\n}\n<\/code><\/pre>\n
\u89e3\u6cd5\u4e8c<\/h3>\n
\u679a\u4e3e\u6bcf\u4e00\u884c\uff0c\u5982\u679c\u7b2c\u4e00\u5217\u5c0f\u4e8e\u6216\u7b49\u4e8etarget<\/code>\uff0c\u6700\u540e\u4e00\u5217\u5927\u4e8e\u6216\u7b49\u4e8etarget<\/code>\uff0c\u5219\u8bf4\u660etarget<\/code>\u6709\u53ef\u80fd\u5b58\u5728\u4e8e\u8fd9\u4e00\u884c\uff0c\u5bf9\u5176\u8fdb\u884c\u4e8c\u5206\u67e5\u627e\u3002\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(m*log(n))<\/code><\/p>\n
public class Solution {\n    public boolean Find(int target, int [][] array) {\n        if (array.length == 0 || array[0].length == 0)\n            return false;\n        for (int i = 0; i < array.length; i++) {\n            if (array[i][0] <= target && array[i][array[i].length - 1] >= target) {\n                int left = 0, right = array[i].length - 1, mid;\n                while (left <= right) {\n                    mid = left + (right - left) \/ 2;\n                    if (array[i][mid] < target)\n                        left = mid + 1;\n                    else if (array[i][mid] > target)\n                        right = mid - 1;\n                    else\n                        return true;\n                }\n            }\n            if (array[i][0] > target)\n                break;\n        }\n        return false;\n    }\n}\n<\/code><\/pre>\n
\u89e3\u6cd5\u4e09<\/h3>\n
\u4e8c\u5206\u67e5\u627e\u884c\u53f7\uff0c\u7b2c\u4e00\u4e2a\u6700\u540e\u4e00\u5217\u5927\u4e8etarget<\/code>\u7684\u884c\uff0c\u8bb0\u4e3abegin<\/code>\uff1b\u4e8c\u5206\u67e5\u627e\u884c\u53f7\uff0c\u6700\u540e\u4e00\u4e2a\u7b2c0\u5217\u5c0f\u4e8etarget<\/code>\u7684\u884c\uff0c\u8bb0\u4e3aend<\/code>\uff1b
\n\u4ecebegin<\/code>\u5230end<\/code>\u679a\u4e3e\u6bcf\u4e00\u884c\uff0c\u5bf9\u5176\u8fdb\u884c\u4e8c\u5206\u67e5\u627e\u3002
\n\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(m*log(n))<\/code><\/p>\n
public class Solution {\n    public boolean Find(int target, int [][] array) {\n        if (array.length == 0 || array[0].length == 0)\n            return false;\n        int i, begin = -1, end = -1;\n        int left = 0, right = array.length - 1, mid;\n        \/\/ \u627e\u5230\u7b2c0\u5217\u6700\u540e\u4e00\u4e2a\u5c0f\u4e8etarget\u7684\u6570\u5b57\n        while (left <= right) {\n            mid = left + (right - left) \/ 2;\n            if (array[mid][0] < target) {\n                end = mid;\n                left = mid + 1;\n            } else if (array[mid][0] == target)\n                return true;\n            else\n                right = mid - 1;\n        }\n\n        \/\/ \u627e\u5230\u6700\u540e\u4e00\u5217\u7b2c\u4e00\u4e2a\u5927\u4e8etarget\u7684\u6570\u5b57\n        left = 0;\n        right = array.length - 1;\n        while (left <= right) {\n            mid = left + (right - left) \/ 2;\n            if (array[mid][array[0].length - 1] < target)\n                left = mid + 1;\n            else if (array[mid][array[0].length - 1] == target)\n                return true;\n            else {\n                begin = mid;\n                right = mid - 1;\n            }\n        }\n        if (begin == -1 || end == -1)\n            return false;\n        \/\/ System.out.println(begin + \" \" + end);\n        for (i = begin; i <= end; i++) {\n            \/\/ \u5bf9\u6bcf\u4e00\u884c\u8fdb\u884c\u4e8c\u5206\u67e5\u627e\n            left = 0;\n            right = array[i].length - 1;\n            while (left <= right) {\n                mid = left + (right - left) \/ 2;\n                if (array[i][mid] < target)\n                    left = mid + 1;\n                else if (array[i][mid] == target)\n                    return true;\n                else\n                    right = mid - 1;\n            }\n        }\n        return false;\n    }\n}\n<\/code><\/pre>\n
\u89e3\u6cd5\u56db<\/h3>\n
\u4ece\u5de6\u4e0b\u89d2\u5f00\u59cb\u679a\u4e3e\uff0c\u5982\u679c\u5c0f\u4e8etarget<\/code>\u5219col++<\/code>\uff1b\u5982\u679c\u5927\u4e8etarget<\/code>\u5219row--<\/code>\u3002
\n\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(m+n)<\/code><\/p>\n
public class Solution {\n    public boolean Find(int target, int [][] array) {\n        if (array.length == 0 || array[0].length == 0)\n            return false;\n        int row = array.length - 1, col = 0;\n        while (row >= 0 && col < array[0].length) {\n            if (array[row][col] < target)\n                col++;\n            else if (array[row][col] > target)\n                row--;\n            else\n                return true;\n        }\n        return false;\n    }\n}\n<\/code><\/pre>\n
\u4e5f\u53ef\u4ee5\u4ece\u53f3\u4e0a\u89d2\u8fdb\u884c\u679a\u4e3e\uff0c\u5982\u679c\u5c0f\u4e8etarget<\/code>\u5219row++<\/code>\uff1b\u5982\u679c\u5927\u4e8etarget<\/code>\u5219col--<\/code>\u3002
\n\u4f46\u662f\u4e0d\u80fd\u4ece\u5de6\u4e0a\u89d2\u548c\u53f3\u4e0b\u89d2\u5f00\u59cb\uff0c\u56e0\u4e3a\u5de6\u4e0a\u89d2\u548c\u53f3\u4e0b\u89d2\u5bf9\u4e8e\u6bcf\u79cd\u60c5\u51b5\u90fd\u5b58\u5728\u4e24\u79cd\u65b9\u5411\u7684\u9009\u62e9\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u9898\u76ee\u63cf\u8ff0 \u5728\u4e00\u4e2a\u4e8c\u7ef4\u6570\u7ec4\u4e2d\uff08\u6bcf\u4e2a\u4e00\u7ef4\u6570\u7ec4\u7684\u957f\u5ea6\u76f8\u540c\uff09\uff0c\u6bcf\u4e00\u884c\u90fd\u6309\u7167\u4ece\u5de6\u5230\u53f3\u9012\u589e\u7684\u987a\u5e8f\u6392\u5e8f\uff0c\u6bcf\u4e00\u5217\u90fd\u6309\u7167\u4ece\u4e0a\u5230\u4e0b […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[39],"class_list":["post-657","post","type-post","status-publish","format-standard","hentry","category-algo","tag-offer"],"_links":{"self":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts\/657","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=657"}],"version-history":[{"count":0,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts\/657\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=657"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=657"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=657"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}