{"id":531,"date":"2025-05-13T23:37:27","date_gmt":"2025-05-13T15:37:27","guid":{"rendered":"https:\/\/www.zackzzp.top\/?p=531"},"modified":"2025-05-14T16:30:52","modified_gmt":"2025-05-14T08:30:52","slug":"%e5%b8%b8%e7%9c%8b%e5%b8%b8%e6%96%b0","status":"publish","type":"post","link":"http:\/\/www.zackzzp.top\/index.php\/2025\/05\/13\/%e5%b8%b8%e7%9c%8b%e5%b8%b8%e6%96%b0\/","title":{"rendered":"\u5e38\u770b\u5e38\u65b0"},"content":{"rendered":"

KMP\u4e00\u6b21\u641e\u61c2<\/h1>\n

\u6c42next\u6570\u7ec4<\/h2>\n

\"image\"<\/div><\/a><\/p>\n
    \/**\n     * \u83b7\u53d6\u4e00\u4e2a\u5b57\u7b26\u4e32 pattern \u7684\u90e8\u5206\u5339\u914d\u8868\n     *\n     * @param patternStr \u7528\u4e8e\u6a21\u5f0f\u5339\u914d\u5b57\u7b26\u4e32\n     * @return \u5b58\u50a8\u90e8\u5206\u5339\u914d\u8868\u7684\u6bcf\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u7684 next\u6570\u7ec4\n     *\/\n    public static int[] kmpNext(String patternStr) {\n        \/\/\u5c06 patternStr \u8f6c\u4e3a \u5b57\u7b26\u6570\u7ec4\u5f62\u5f0f\n        char[] patternArr = patternStr.toCharArray();\n\n        \/\/\u9884\u5148\u521b\u5efa\u4e00\u4e2anext\u6570\u7ec4\uff0c\u7528\u4e8e\u5b58\u50a8\u90e8\u5206\u5339\u914d\u8868\u7684\u6bcf\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\n        int[] next = new int[patternStr.length()];\n\n        \/*\n            \u4ece\u7b2c\u4e00\u4e2a\u5b57\u7b26\uff08\u5bf9\u5e94\u7d22\u5f15\u4e3a0\uff09\u5f00\u59cb\u7684\u5b50\u4e32\uff0c\u5982\u679c\u5b50\u4e32\u7684\u957f\u5ea6\u4e3a1\uff0c\u90a3\u4e48\u80af\u5b9a\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u4e3a0\n            \u56e0\u4e3a\u8fd9\u552f\u4e00\u7684\u4e00\u4e2a\u5b57\u7b26\u65e2\u662f\u7b2c\u4e00\u4e2a\u5b57\u7b26\uff0c\u53c8\u662f\u6700\u540e\u4e00\u4e2a\u5b57\u7b26\uff0c\u6240\u4ee5\u524d\u540e\u7f00\u90fd\u4e0d\u5b58\u5728 -> \u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u4e3a0\n         *\/\n        next[0] = 0;\n\n        \/*\n          len\u6709\u4e24\u4e2a\u4f5c\u7528\uff1a\n            1. \u7528\u4e8e\u8bb0\u5f55\u5f53\u524d\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\n            2. \u540c\u65f6\u77e5\u9053\u5f53\u524d\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u7684\u524d\u7f00\u5b57\u7b26\u4e32\u5bf9\u5e94\u7d22\u5f15 [0,len-1]\/\u5f53\u524d\u5b50\u4e32\u6700\u957f\u516c\u5171\u524d\u7f00\u5b57\u7b26\u4e32\u7684\u4e0b\u4e00\u4e2a\u5b57\u7b26\u7684\u7d22\u5f15  <-- \u53ef\u4ee5\u62ff\u793a\u4f8b\u5206\u6790\u4e00\u4e0b\n         *\/\n        int len = 0;\n\n        \/\/\u4ece\u7b2c\u4e8c\u4e2a\u5b57\u7b26\u5f00\u59cb\u904d\u5386\uff0c\u6c42\u7d22\u5f15\u5728 [0,i] \u7684\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\n        int i = 1;\n        while (i < patternArr.length) {\n            \/*\n                1.\u5df2\u7ecf\u77e5\u9053\u4e86\u4e0a\u4e00\u4e2a\u5b50\u4e32 \u5bf9\u5e94\u7d22\u5f15[0,i-1] \u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\u4e3a len\n                  \u7684\u524d\u7f00\u5b57\u7b26\u4e32\u662f \u7d22\u5f15[0,len-1]\uff0c\u5bf9\u5e94\u76f8\u7b49\u7684\u540e\u7f00\u5b57\u7b26\u4e32\u662f \u7d22\u5f15[i-len,i-1]\n\n                2.\u56e0\u6b64\u6211\u4eec\u53ef\u4ee5\u4ee5 \u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32 \u4f5c\u4e3a\u62fc\u63a5\u53c2\u8003\n                  \u6bd4\u8f83\u4e00\u4e0b patternArr[len] \u4e0e patternArr[i] \u662f\u5426\u76f8\u7b49\n             *\/\n            if (patternArr[len] == patternArr[i]) {\n                \/*\n                    1.\u5982\u679c\u76f8\u7b49\u5373 patternArr[len]==patternArr[i]\uff0c\n                      \u90a3\u4e48\u5c31\u53ef\u4ee5\u786e\u5b9a\u5f53\u524d\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u7684\n                      \u524d\u7f00\u5b57\u7b26\u4e32\u662f \u7d22\u5f15[0,len] \uff0c\u5bf9\u5e94\u76f8\u7b49\u7684\u540e\u7f00\u5b57\u7b26\u4e32\u662f \u7d22\u5f15[i-len,i]\n\n                    2.\u7531\u4e8e\u662f\u62fc\u63a5\u64cd\u4f5c\uff0c\u90a3\u4e48\u5f53\u524d\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\u53ea\u9700\u8981\u5728\u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\u7684\u57fa\u7840\u4e0a +1 \u5373\u53ef\n                      \u5373 next[i] = next[i-1] + 1 \uff0c\n\n                    3.\u7531\u4e8e len \u662f\u8bb0\u5f55\u7684\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\uff0c\u5bf9\u4e8e\u5f53\u524d\u6211\u4eec\u6240\u5728\u7684\u4ee3\u7801\u4f4d\u7f6e\u800c\u8a00\n                      len \u8fd8\u662f\u8bb0\u5f55\u7684\u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\uff0c\u56e0\u6b64\uff1a\n                      next[i] = next[i-1] + 1 \u7b49\u4ef7\u4e8e next[i] = ++len\n                 *\/\n\n                \/\/ \u7b49\u4ef7\u4e8e next[i] = next[i-1] + 1\n                next[i] = ++len;\n                \/\/\u65e2\u7136\u627e\u5230\u4e86\u7d22\u5f15\u5728[0,i]\u7684\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\u957f\u5ea6\uff0c\u90a3\u5c31 i+1 \u53bb\u5224\u65ad\u4ee5\u4e0b\u4e00\u4e2a\u5b57\u7b26\u7ed3\u5c3e\u7684\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\n                i++;\n            }else {\n                \/*\n                    1.\u5982\u679c\u4e0d\u76f8\u7b49 patternArr[len]!=patternArr[i]\n                      \u6211\u4eec\u60f3\u8981\u6c42\u5f53\u524d\u5b50\u4e32 \u5bf9\u5e94\u7d22\u5f15[0,i] \u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u957f\u5ea6\n                      \u6211\u4eec\u5c31\u4e0d\u80fd\u4ee5 \u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\uff1a\u524d\u7f00\u5b57\u7b26\u4e32pre  \u540e\u7f00\u5b57\u7b26\u4e32post \uff08\u6beb\u65e0\u7591\u95eepre==post\uff09 \u4f5c\u4e3a\u62fc\u63a5\u53c2\u8003\n\n                    2.\u4f46\u53ef\u4ee5\u601d\u8003\u4e00\u4e0b\uff1a\n                      pre\u7684\u6700\u957f\u516c\u5171\u524d\u7f00\u5b57\u7b26\u4e32\uff1a \u7d22\u5f15 [      0        , next[len-1] )\n                      \u662f\u7b49\u4e8e\n                      post\u7684\u6700\u957f\u516c\u5171\u540e\u7f00\u5b57\u7b26\u4e32\uff1a\u7d22\u5f15 [ i-next[len-1] ,     i       )\n\n                      \u5219\u6211\u4eec \u5c31\u4ee5 pre\u7684\u6700\u957f\u516c\u5171\u524d\u7f00\u5b57\u7b26\u4e32\/post\u7684\u6700\u957f\u516c\u5171\u540e\u7f00\u5b57\u7b26\u4e32 \u4f5c\u4e3a\u62fc\u63a5\u53c2\u8003\n                      \u53bb\u5224\u65ad pre\u7684\u6700\u957f\u516c\u5171\u524d\u7f00\u5b57\u7b26\u4e32\u7684\u4e0b\u4e00\u4e2a\u5b57\u7b26patternArr[next[len-1]] \u662f\u5426\u7b49\u4e8e post\u7684\u6700\u957f\u516c\u5171\u540e\u7f00\u5b57\u7b26\u4e32\u7684\u4e0b\u4e00\u4e2a\u5b57\u7b26patternArr[i]\n\n                    3.\u5728\u7b2c 1,2 \u6b65\u5206\u6790\u7684\u57fa\u7840\u4e0a\n                      \u6211\u4eec\u53ef\u4ee5\u5728\u5224\u65ad\u51fa patternArr[len]!=patternArr[i] \u540e\uff0c\n                      \u4e0d\u53bb\u6267\u884c\u7b2c\u4e8c\u6b65\uff1apatternArr[next[len-1]] \u662f\u5426\u7b49\u4e8e patternArr[i]\uff0c\n                      \u53ef\u4ee5\u5148\u4fee\u6539len\u7684\u503c\uff1alen = next[len-1]\uff0clen\u5c31\u6210\u4e86 pre\u7684\u6700\u957f\u516c\u5171\u524d\u7f00\u5b57\u7b26\u4e32\u957f\u5ea6\/post\u7684\u6700\u957f\u516c\u5171\u540e\u7f00\u5b57\u7b26\u4e32\u957f\u5ea6\uff0c\n                      \u4fee\u6539\u5b8c\u4e4b\u540e\uff0c\u518d\u53bb\u5224\u65ad\u4e0b\u4e00\u4e2a\u5b57\u7b26 \u662f\u5426\u76f8\u7b49\uff0c\u5373 \u5224\u65ad patternArr[len] \u662f\u5426\u7b49\u4e8e patternArr[i]\n                      \u4ed4\u7ec6\u89c2\u5bdf\uff0c\u8fd9\u4e0d\u53c8\u662f\u5728\u5224\u65ad \u8fd9\u4e2a\u5faa\u73af\u4e2d if-else \u8bed\u53e5\u5417\n\n                    4.\u5173\u4e8e len \u8fd9\u4e2a\u503c\uff0c\u5728\u5faa\u73af\u5f00\u59cb\u65f6\u6211\u4eec\u89e3\u91ca\u7684\u662f\uff1a\u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\u7684\u957f\u5ea6\n                      \u4f46\u5b9e\u9645\u4e0a\u6211\u4eec\u5728\u8fd9\u91cc\u6539\u4e3a len = next[len-1] \u8868\u793a\u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\u7684\u957f\u5ea6\n                      \u662f\u6ca1\u6709\u95ee\u9898\u7684\uff0c\u7b49\u4ef7\u4e8e\u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u8f83\u5c0f\u7684\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\u3002\n                      \u65e2\u7136\u8fdb\u5165\u4e86 else \u8bed\u53e5\u8bf4\u660e\u5b57\u7b26\u4e0d\u76f8\u7b49\uff0c\u5c31\u4e0d\u80fd\u4ee5 \u4e0a\u4e00\u4e2a\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32 \u4f5c\u4e3a \u62fc\u63a5\u53c2\u8003\uff0c\u5c31\u5e94\u5f53\u53bb\u7f29\u5c0f\u53c2\u8003\u8303\u56f4\u3002\n                 *\/\n                if(len==0) {\n\n                    \/*\n                        len\u4e3a0\u8bf4\u660e\u4e0a\u4e00\u4e2a\u5b50\u4e32\u5df2\u7ecf\u6ca1\u6709\u4e86\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\n                        \u5219\u6211\u4eec\u6ca1\u6709\u7ee7\u7eed\u5bfb\u627e\u7684\u5fc5\u8981 --> \u7d22\u5f15\u5728[0, i]\u7684\u5f53\u524d\u5b50\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\u957f\u5ea6\u5c31\u662f0\n                     *\/\n                    next[i] = len;\n\n                    \/\/\u7ee7\u7eed\u5bfb\u627e\u4e0b\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u957f\u516c\u5171\u524d\u540e\u7f00\u5b57\u7b26\u4e32\u957f\u5ea6\n                    i++;\n\n                }else{\n                    len = next[len - 1];\n                }\n\n            }\n        }\n\n        return next;\n    }\n\n<\/code><\/pre>\n
\u81ea\u884c\u5b9e\u73b0<\/h2>\n
\u914d\u56fe\u597d\u7406\u89e3<\/p>\n
\"image\"<\/div><\/a><\/p>\n
package org.example;\n\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class Kmp {\n    public int[] getNext(String pattern) {\n        char[] chars = pattern.toCharArray();\n        int[] next = new int[chars.length];\n        next[0] = 0;\n        int len = 0;\n        int i = 1;\n        while (i < chars.length) {\n            \/\/\u5982\u679c\u4f60\u7684\u65b0\u5b57\u7b26\u4e32\u7684\u6700\u540e\u4e00\u4e2a\u5b57\u7b26\u548c\u524d\u4e00\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u5171\u524d\u7f00\u7684\u540e\u4e00\u4e2a\u5b57\u7b26\u76f8\u540c\uff0c\u90a3\u4f60\u7684\u65b0\u5b57\u7b26\u4e32\u7684next\u503c\u5c31\u53ef\u4ee5\u4ee5\u524d\u4e00\u4e2a\u505a\u53c2\u8003\n            if (chars[i] == chars[len]) {\n                next[i] = len++;\n                i++;\n            } else {\n                \/\/\u5f53\u4e0d\u6ee1\u8db3\u4e0a\u8ff0\u60c5\u51b5\u7684\u65f6\u5019\uff0c\u9700\u8981\u548c\u524d\u4e00\u4e2a\u5b57\u7b26\u7684\u6700\u957f\u516c\u5171\u524d\u7f00\u7684\u540e\u4e00\u4e2a\u5b57\u7b26\u6bd4\u8f83\uff0c\u56e0\u4e3a\u4f60\u524d\u4e00\u4e2a\u5b57\u7b26\u6709\u516c\u5171\u524d\u540e\u7f00\u7684\u8bdd\uff0c\u524d\u7f00\u548c\u540e\u7f00\u76f8\u540c\uff0c\u8981\u901a\u8fc7\u8fd9\u4e2a\u66f4\u5feb\u627e\u5230\u6700\u5927\u524d\u540e\u7f00\n                if (len == 0)\n                    next[i] = 0;\n                else {\n                    len = next[len - 1];\n                }\n            }\n        }\n        return next;\n    }\n\n    \/\/\u5339\u914d\u5230\u4e00\u4e2a\u5c31OK\n    public int KmpSearchOne(String matchStr, String patternStr, int next[]) {\n        int i = 0, j = 0;\n        while (i < matchStr.length() && j < patternStr.length()) {\n            if (matchStr.charAt(i) == patternStr.charAt(j)) {\n                i++;\n                j++;\n            } else {\n                if (j == 0)\n                    i++;\n                else\n                    j = next[j - 1];\n            }\n        }\n        return j == patternStr.length() ? i - j : -1;\n    }\n\n\n    \/\/\u53ef\u5339\u914d\u591a\u4e2a\uff0c\u5141\u8bb8\u6709\u591a\u4e2a\u91cd\u590d\u5b57\u7b26\u4e32\n    public List<Integer> KmpSearchAllSame(String matchStr, String patternStr, int next[]) {\n        List<Integer> list = new ArrayList<>();\n        int i = 0, j = 0;\n        while (i < matchStr.length() && j < patternStr.length()) {\n            if (matchStr.charAt(i) == patternStr.charAt(j)) {\n                i++;\n                j++;\n            } else {\n                if (j == 0)\n                    i++;\n                else\n                    j = next[j - 1];\n            }\n            if (j == patternStr.length()) {\n                list.add(i - j);\n                j = next[j - 1];\n            }\n        }\n        return list;\n    }\n\n    \/\/\u5339\u914d\u591a\u4e2a\uff0c\u4e0d\u5141\u8bb8\u6709\u91cd\u590d\u5b57\u7b26\u4e32\n    public List<Integer> KmpSerchAllNoSame(String matchStr, String patternStr, int next[]) {\n        List<Integer> list = new ArrayList<>();\n        int i = 0, j = 0;\n        while (i < matchStr.length() && j < patternStr.length()) {\n            if (matchStr.charAt(i) == patternStr.charAt(j)) {\n                i++;\n                j++;\n            } else {\n                if (j == 0)\n                    i++;\n                else\n                    j = next[j - 1];\n                }\n            }\n        if (j == patternStr.length()) {\n            list.add(i - j);\n            j = 0;\n        }\n        return list;\n    }\n}\n\n\n<\/code><\/pre>\n
\u516b\u5927\u6392\u5e8f\u7b97\u6cd5<\/h1>\n
\u770b\u56fe\u7406\u89e3<\/a><\/p>\n
package org.example;\n\npublic class Sort {\n    \/\/\u63d2\u5165\u6392\u5e8f\n    \/\/\u5728\u4e0d\u65ad\u5411\u540e\u904d\u5386\u7684\u8fc7\u7a0b\u4e2d\uff0c\u5c06\u5f53\u524d\u5143\u7d20\u63d2\u5165\u5230\u524d\u65b9\u5df2\u7ecf\u6392\u5e8f\u7684\u5143\u7d20\u4e2d\n    public void insertionSort(int[] arr) {\n        for (int i = 1; i < arr.length; i++) {\n            int val = arr[i];\n            int j = i;\n            while (j > 0 && arr[j - 1] > val) {\n                arr[j] = arr[j - 1];\n                j--;\n            }\n            arr[j] = val;\n        }\n    }\n\n    \/\/\u5192\u6ce1\u6392\u5e8f\n    \/\/\u4e24\u4e24\u6bd4\u8f83\uff0c\u5c06\u6700\u5927\u7684\u6570\u5192\u6ce1\u5230\u672b\u5c3e\n    public void bubbleSort(int[] arr) {\n        for (int i = 0; i < arr.length - 1; i++) {\n            \/\/\u7528\u6765\u6807\u8bc6\u662f\u5426\u8fdb\u884c\u8fc7\u4ea4\u6362\uff0c\u6ca1\u6709\u4ea4\u6362\u5219\u8bc1\u660e\u5df2\u7ecf\u6392\u5e8f\u5b8c\u6bd5\n            boolean flag = true;\n            \/\/\u6bcf\u6b21for\u5faa\u73af\u4f1a\u786e\u5b9a\u4e00\u4e2a\u6700\u5927\u7684\u5143\u7d20\uff0c\u76f4\u81f3\u5168\u90e8\u6709\u5e8f\n            for (int j = 0; j < arr.length - i - 1; j++) {\n                if (arr[j] > arr[j + 1]) {\n                    int temp = arr[j];\n                    arr[j] = arr[j + 1];\n                    arr[j + 1] = temp;\n                    flag = false;\n                }\n            }\n            if (flag) {\n                break;\n            }\n        }\n    }\n\n    \/\/\u9009\u62e9\u6392\u5e8f\n    \/\/\u6bcf\u6b21\u9009\u62e9\u6700\u5c0f\u7684\u5143\u7d20\uff0c\u5c06\u5176\u653e\u5230\u5f53\u524d\u4f4d\u7f6e\n    public void selectionSort(int[] arr) {\n        int len = arr.length;\n        for (int i = 0; i < len; i++) {\n            int minval = i;\n            for (int j = minval + 1; j < len; j++) {\n                if (arr[j] < arr[minval]) {\n                    minval = j;\n                }\n            }\n            if (minval != i) {\n                int temp = arr[i];\n                arr[i] = arr[minval];\n                arr[minval] = temp;\n            }\n        }\n    }\n\n    \/\/\u5e0c\u5c14\u6392\u5e8f\n    \/\/\u5e0c\u5c14\u6392\u5e8f\u662f\u63d2\u5165\u6392\u5e8f\u7684\u6539\u8fdb\u7248\uff0c\u5b83\u4f7f\u7528\u4e00\u4e2a\u589e\u91cf\u5e8f\u5217\u6765\u63a7\u5236\u63d2\u5165\u6392\u5e8f\u7684\u6b65\u957f\uff0c\n    \/\/\u7136\u540e\u5bf9\u5e8f\u5217\u8fdb\u884c\u5206\u7ec4\uff0c\u5bf9\u6bcf\u7ec4\u8fdb\u884c\u63d2\u5165\u6392\u5e8f\uff0c\u6700\u540e\u518d\u5bf9\u6574\u4e2a\u5e8f\u5217\u8fdb\u884c\u63d2\u5165\u6392\u5e8f\u3002\n    public void shellSort(int[] arr) {\n        int len = arr.length;\n        for (int gap = len \/ 2; gap > 0; gap \/= 2) {\n            for (int i = gap; i < len; i++) {\n                int tmep = arr[i];\n                int j = i - gap;\n                while (j >= 0 && arr[j] > tmep) {\n                    arr[j + gap] = arr[j];\n                    j -= gap;\n                }\n                arr[j + gap] = tmep;\n            }\n        }\n    }\n\n    \/\/\u5f52\u5e76\u6392\u5e8f\n    public void mergeSort(int[] arr) {\n        if (arr.length <= 1)\n            return;\n        int mid = arr.length \/ 2;\n        int[] left = new int[mid];\n        int[] right = new int[arr.length - mid];\n        for (int i = 0; i < mid; i++) {\n            left[i] = arr[i];\n        }\n        for (int i = mid; i < arr.length; i++) {\n            right[i - mid] = arr[i];\n        }\n        mergeSort(left);\n        mergeSort(right);\n        arr = merge(left, right);\n\n    }\n\n    public int[] merge(int[] left, int[] right) {\n        int i = 0, j = 0, k = 0;\n        int result[] = new int[left.length + right.length];\n        while (i < left.length && j < right.length) {\n            if (left[i] < right[j]) {\n                result[k++] = left[i++];\n            } else {\n                result[k++] = right[j++];\n            }\n        }\n        while (i < left.length) {\n            result[k++] = left[i++];\n        }\n        while (j < right.length) {\n            result[k++] = right[j++];\n        }\n        return result;\n    }\n\n\n    \/\/\u5feb\u901f\u6392\u5e8f\n    \/\/\u5148\u51b3\u6761\u4ef6left=0,right=arr.length-1\n    public void quickSort(int[] arr, int left, int right) {\n        for (int i = 0; i < arr.length; i++) {\n            int base=arr[i];\n            while (left<right){\n                while (left<right&&arr[right]>=base){\n                    right--;\n                }\n                arr[left]=arr[right];\n                while (left<right&&arr[left]<=base){\n                    left++;\n                }\n                arr[right]=arr[left];\n            }\n            arr[left]=base;\n            quickSort(arr,0,left-1);\n            quickSort(arr,left+1,right);\n        }\n    }\n\n    \/\/\u5806\u6392\u5e8f\n    \/\/\u5efa\u5806\n    int []arr=new int[10];\n    \/\/\u8fd9\u91cc\u8981\u505a\u7edf\u4e00\u7684\u7ba1\u7406\uff0c\u9632\u6b62\u5efa\u5806\u628a\u5df2\u7ecf\u6392\u5e8f\u7684\u91cd\u65b0\u5efa\u5806\n    int len=arr.length;\n    public void buildHeap(int[] arr,int index) {\n        int left = index * 2 + 1;\n        int right = index * 2 + 2;\n        int max = index;\n        if (left < len && arr[left] > arr[max]) {\n            max = left;\n        }\n        if (right < len && arr[right] > arr[max]) {\n            max = right;\n        }\n        if (max != index) {\n            int temp = arr[index];\n            arr[index] = arr[max];\n            arr[max] = temp;\n            buildHeap(arr, max);\n        }\n    }\n\n    public void heapSort(int[] arr) {\n        for (int i = arr.length; i >= 0; i--) {\n            buildHeap(arr, i);\n        }\n        for (int i = arr.length-1; i >=0 ; i--) {\n            swap(arr,0,len-1);\n            buildHeap(arr,i);\n            len--;\n        }\n    }\n\n    public void swap(int[] arr, int i, int j) {\n        int temp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = temp;\n    }\n\n    \/\/\u8ba1\u6570\u6392\u5e8f\n    public void countSort(int[] arr) {\n        int max = arr[0];\n        int min = arr[0];\n        for (int i = 1; i < arr.length; i++) {\n            if (arr[i] > max) {\n                max = arr[i];\n            }\n            if (arr[i] < min) {\n                min = arr[i];\n            }\n        }\n        int[] countArr = new int[max - min + 1];\n        for (int val : arr) {\n            countArr[val - min]++;\n        }\n        for (int arrIdx = 0, countIdx = 0; countIdx < countArr.length; countIdx++) {\n            while (countArr[countIdx]-- > 0) {\n                arr[arrIdx++] = min + countIdx;\n            }\n        }\n\n    }\n}\n<\/code><\/pre>\n
<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
KMP\u4e00\u6b21\u641e\u61c2 \u6c42next\u6570\u7ec4 \/** * \u83b7\u53d6\u4e00\u4e2a\u5b57\u7b26\u4e32 pattern \u7684\u90e8\u5206\u5339\u914d\u8868 * * @param […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":true,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-531","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/posts\/531","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/comments?post=531"}],"version-history":[{"count":4,"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/posts\/531\/revisions"}],"predecessor-version":[{"id":538,"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/posts\/531\/revisions\/538"}],"wp:attachment":[{"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/media?parent=531"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/categories?post=531"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.zackzzp.top\/index.php\/wp-json\/wp\/v2\/tags?post=531"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}