{"id":2420,"date":"2022-03-22T17:05:09","date_gmt":"2022-03-22T09:05:09","guid":{"rendered":"https:\/\/www.zeroheart.xyz\/wordpress\/?p=2420"},"modified":"2022-03-24T10:51:56","modified_gmt":"2022-03-24T02:51:56","slug":"%e5%8f%8c%e6%8c%87%e9%92%88","status":"publish","type":"post","link":"https:\/\/www.zeroheart.xyz\/wordpress\/?p=2420","title":{"rendered":"\u7b97\u6cd5\u5165\u95e8\u7b2c\u4e8c\u5929"},"content":{"rendered":"\n

\u53cc\u6307\u9488<\/h2>\n\n\n\n

\u300c\u7b97\u6cd5\u300d – \u5b66\u4e60\u8ba1\u5212 – \u529b\u6263\uff08LeetCode\uff09\u5168\u7403\u6781\u5ba2\u631a\u7231\u7684\u6280\u672f\u6210\u957f\u5e73\u53f0 (leetcode-cn.com)<\/a><\/p>\n\n\n\n

977. \u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9<\/a><\/p>\n\n\n\n

\/**
<\/em>
<\/em> \u7ed9\u4f60\u4e00\u4e2a\u6309 \u975e\u9012\u51cf\u987a\u5e8f \u6392\u5e8f\u7684\u6574\u6570\u6570\u7ec4 nums\uff0c\u8fd4\u56de \u6bcf\u4e2a\u6570\u5b57\u7684\u5e73\u65b9 \u7ec4\u6210\u7684\u65b0\u6570\u7ec4\uff0c\u8981\u6c42\u4e5f\u6309 \u975e\u9012\u51cf\u987a\u5e8f \u6392\u5e8f\u3002
<\/em>
<\/em>
<\/em>
<\/em> \u793a\u4f8b 1\uff1a
<\/em>
<\/em> \u8f93\u5165\uff1anums = [-4,-1,0,3,10]
<\/em> \u8f93\u51fa\uff1a[0,1,9,16,100]
<\/em> \u89e3\u91ca\uff1a\u5e73\u65b9\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [16,1,0,9,100]
<\/em> \u6392\u5e8f\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [0,1,9,16,100]
<\/em> \u793a\u4f8b 2\uff1a
<\/em>
<\/em> \u8f93\u5165\uff1anums = [-7,-3,2,3,11]
<\/em> \u8f93\u51fa\uff1a[4,9,9,49,121]
<\/em>
<\/em>
<\/em> \u63d0\u793a\uff1a
<\/em>
<\/em> 1 <= nums.length <= 10^4
<\/em> -10^4 <= nums[i] <= 10^4
<\/em> nums \u5df2\u6309 \u975e\u9012\u51cf\u987a\u5e8f \u6392\u5e8f
<\/em>
<\/em>
<\/em> \u8fdb\u9636\uff1a
<\/em>
<\/em> \u8bf7\u4f60\u8bbe\u8ba1\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(n) \u7684\u7b97\u6cd5\u89e3\u51b3\u672c\u95ee\u9898
<\/em>
<\/em>
<\/em> \u6765\u6e90\uff1a\u529b\u6263\uff08LeetCode\uff09
<\/em> \u94fe\u63a5\uff1ahttps:\/\/leetcode-cn.com\/problems\/squares-of-a-sorted-array
<\/em> \u8457\u4f5c\u6743\u5f52\u9886\u6263\u7f51\u7edc\u6240\u6709\u3002\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u8054\u7cfb\u5b98\u65b9\u6388\u6743\uff0c\u975e\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u6ce8\u660e\u51fa\u5904\u3002
<\/em>
<\/em>
<\/em> * <\/em>@author <\/em><\/strong>zeroheart
<\/em> *
<\/em> *\/
<\/em>public class Question977 {
    public int[] sortedSquares(int[] nums) {
        \/\/ \u53cc\u6307\u9488
        \/\/ https:\/\/code-thinking.cdn.bcebos.com\/gifs\/977.%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.gif
        \/\/ \u4e00\u4e2a\u6307\u9488\u5728\u6700\u524di\uff0c\u4e00\u4e2a\u5728\u6700\u540ej\uff0c\u56e0\u4e3a\u8d1f\u6570\u5e73\u65b9\u4e4b\u540e\uff0c\u53ef\u80fd\u662f\u6700\u5927\u7684\uff0c\u6240\u4ee5\u628a\u7ed3\u679c\u6570\u7ec4\u7684\u6307\u9488\uff0c\u653e\u5230\u6700\u540e\uff0c\u5224\u65ad\u662fnums[i]*nums[i]\u5927\u8fd8\u662fnums[j]*nums[j]\u5927\uff0c\u4e22\u5230\u91cc\u9762
        int i = 0, j = nums.length -1;
        int[] result = new int[nums.length];
        for(int k = nums.length-1; k >= 0; k--){
            if(nums[i] * nums[i] > nums[j] * nums[j]){
                result[k] = nums[i] * nums[i];
                i++;
            }else {
                result[k] = nums[j] * nums[j];
                j--;
            }
        }

        return result;
    }

    \/**
<\/em>     * \u8c03\u7528\u5de5\u5177\uff0c\u5148\u5b9e\u73b0\u4e00\u7248
<\/em>     * <\/em>@param <\/em><\/strong>nums
<\/em>     <\/em>* <\/em>@return
<\/em><\/strong>     <\/em><\/strong>*\/
<\/em>    <\/em>public int[] sortedSquares1(int[] nums) {
        for(int i = 0; i < nums.length; i++){
            nums[i] = nums[i] * nums[i];
        }
        Arrays.sort<\/em>(nums);
        return nums;
    }

}<\/pre>\n\n\n\n
977.\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9.gif (614\u00d7386) (bcebos.com)<\/a> \u53cc\u6307\u9488\u7684\u52a8\u753b<\/mark><\/p>\n\n\n\n
189. \u8f6e\u8f6c\u6570\u7ec4<\/a>\uff0c\u8fd9\u9898\u4f7f\u7528\u7684\u662f\u6570\u7ec4\u7ffb\u8f6c\uff0c\u7ffb\u8f6c\u7684\u4ee3\u7801\u901a\u7528\uff0c\u540e\u9762\u9047\u5230\u4e5f\u53ef\u4ee5\u7167\u642c\u3002<\/p>\n\n\n\n
\/**\n\n \u7ed9\u4f60\u4e00\u4e2a\u6570\u7ec4\uff0c\u5c06\u6570\u7ec4\u4e2d\u7684\u5143\u7d20\u5411\u53f3\u8f6e\u8f6c k \u4e2a\u4f4d\u7f6e\uff0c\u5176\u4e2d k \u662f\u975e\u8d1f\u6570\u3002\n\n\n\n \u793a\u4f8b 1:\n\n \u8f93\u5165: nums = [1,2,3,4,5,6,7], k = 3\n \u8f93\u51fa: [5,6,7,1,2,3,4]\n \u89e3\u91ca:\n \u5411\u53f3\u8f6e\u8f6c 1 \u6b65: [7,1,2,3,4,5,6]\n \u5411\u53f3\u8f6e\u8f6c 2 \u6b65: [6,7,1,2,3,4,5]\n \u5411\u53f3\u8f6e\u8f6c 3 \u6b65: [5,6,7,1,2,3,4]\n \u793a\u4f8b 2:\n\n \u8f93\u5165\uff1anums = [-1,-100,3,99], k = 2\n \u8f93\u51fa\uff1a[3,99,-1,-100]\n \u89e3\u91ca:\n \u5411\u53f3\u8f6e\u8f6c 1 \u6b65: [99,-1,-100,3]\n \u5411\u53f3\u8f6e\u8f6c 2 \u6b65: [3,99,-1,-100]\n\n\n \u63d0\u793a\uff1a\n\n 1 <= nums.length <= 10^5\n -231 <= nums[i] <= 231 - 1\n 0 <= k <= 10^5\n\n\n \u8fdb\u9636\uff1a\n\n \u5c3d\u53ef\u80fd\u60f3\u51fa\u66f4\u591a\u7684\u89e3\u51b3\u65b9\u6848\uff0c\u81f3\u5c11\u6709 \u4e09\u79cd \u4e0d\u540c\u7684\u65b9\u6cd5\u53ef\u4ee5\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\u3002\n \u4f60\u53ef\u4ee5\u4f7f\u7528\u7a7a\u95f4\u590d\u6742\u5ea6\u4e3a O(1) \u7684 \u539f\u5730 \u7b97\u6cd5\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\u5417\uff1f\n\n \u6765\u6e90\uff1a\u529b\u6263\uff08LeetCode\uff09\n \u94fe\u63a5\uff1ahttps:\/\/leetcode-cn.com\/problems\/rotate-array\n \u8457\u4f5c\u6743\u5f52\u9886\u6263\u7f51\u7edc\u6240\u6709\u3002\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u8054\u7cfb\u5b98\u65b9\u6388\u6743\uff0c\u975e\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u6ce8\u660e\u51fa\u5904\u3002\n\n\n\n\n * @author zeroheart\n *\n *\/\npublic class Question189 {\n    \/**\n     * \u76f4\u63a5\u770b\u53c2\u8003\u7b54\u6848\u4e86\u3002\u3002\n     *\n     * \u8be5\u65b9\u6cd5\u57fa\u4e8e\u5982\u4e0b\u7684\u4e8b\u5b9e\uff1a\u5f53\u6211\u4eec\u5c06\u6570\u7ec4\u7684\u5143\u7d20\u5411\u53f3\u79fb\u52a8 kk \u6b21\u540e\uff0c\u5c3e\u90e8 k\\bmod nkmodn \u4e2a\u5143\u7d20\u4f1a\u79fb\u52a8\u81f3\u6570\u7ec4\u5934\u90e8\uff0c\u5176\u4f59\u5143\u7d20\u5411\u540e\u79fb\u52a8 k\\bmod nkmodn \u4e2a\u4f4d\u7f6e\u3002\n     *\n     * \u8be5\u65b9\u6cd5\u4e3a\u6570\u7ec4\u7684\u7ffb\u8f6c\uff1a\u6211\u4eec\u53ef\u4ee5\u5148\u5c06\u6240\u6709\u5143\u7d20\u7ffb\u8f6c\uff0c\u8fd9\u6837\u5c3e\u90e8\u7684 k\\bmod nkmodn \u4e2a\u5143\u7d20\u5c31\u88ab\u79fb\u81f3\u6570\u7ec4\u5934\u90e8\uff0c\u7136\u540e\u6211\u4eec\u518d\u7ffb\u8f6c [0, k\\bmod n-1][0,kmodn\u22121] \u533a\u95f4\u7684\u5143\u7d20\u548c [k\\bmod n, n-1][kmodn,n\u22121] \u533a\u95f4\u7684\u5143\u7d20\u5373\u80fd\u5f97\u5230\u6700\u540e\u7684\u7b54\u6848\u3002\n     *\n     * \u6211\u4eec\u4ee5 n=7\uff0ck=3 \u4e3a\u4f8b\u8fdb\u884c\u5982\u4e0b\u5c55\u793a\uff1a\n     *\n     * \u64cd\u4f5c\t\u7ed3\u679c\n     * \u539f\u59cb\u6570\u7ec4\t 1 2 3 4 5 6 7\n     * \u7ffb\u8f6c\u6240\u6709\u5143\u7d20 [0, n-1]\t 7 6 5 4 3 2 1\n     * \u7ffb\u8f6c [0, (k mod n) \u22121] \u533a\u95f4\u7684\u5143\u7d20\t 5 6 7 4 3 2 1\n     * \u7ffb\u8f6c [(k mod n),n\u22121] \u533a\u95f4\u7684\u5143\u7d20\t 5 6 7 1 2 3 4\n     *\n     * \u4f5c\u8005\uff1aLeetCode-Solution\n     * \u94fe\u63a5\uff1ahttps:\/\/leetcode-cn.com\/problems\/rotate-array\/solution\/xuan-zhuan-shu-zu-by-leetcode-solution-nipk\/\n     * \u6765\u6e90\uff1a\u529b\u6263\uff08LeetCode\uff09\n     * \u8457\u4f5c\u6743\u5f52\u4f5c\u8005\u6240\u6709\u3002\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u8054\u7cfb\u4f5c\u8005\u83b7\u5f97\u6388\u6743\uff0c\u975e\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u6ce8\u660e\u51fa\u5904\u3002\n     *\n     * @param nums\n     * @param k\n     *\/\n    public void rotate(int[] nums, int k) {\n        k %= nums.length;\n        reverse(nums, 0, nums.length - 1);\n        reverse(nums, 0, k - 1);\n        reverse(nums, k, nums.length - 1);\n    }\n\n    public void reverse(int[] nums, int start, int end) {\n        while(start < end){\n            int temp = nums[start];\n            nums[start] = nums[end];\n            nums[end] = temp;\n            start++;\n            end--;\n        }\n    }\n}<\/pre>\n","protected":false},"excerpt":{"rendered":"
\u53cc\u6307\u9488 \u300c\u7b97\u6cd5\u300d – \u5b66\u4e60\u8ba1\u5212 – \u529b\u6263\uff08LeetCode\uff09\u5168\u7403\u6781\u5ba2\u631a\u7231\u7684\u6280\u672f\u6210\u957f\u5e73\u53f0 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[155],"tags":[157],"_links":{"self":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/2420"}],"collection":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2420"}],"version-history":[{"count":11,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/2420\/revisions"}],"predecessor-version":[{"id":2474,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/2420\/revisions\/2474"}],"wp:attachment":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2420"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2420"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2420"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}