{"id":615,"date":"2019-09-20T18:55:28","date_gmt":"2019-09-20T10:55:28","guid":{"rendered":"http:\/\/47.101.202.111\/?p=615"},"modified":"2023-04-07T15:27:04","modified_gmt":"2023-04-07T07:27:04","slug":"%e7%ae%97%e6%b3%95%e9%80%92%e5%bd%92","status":"publish","type":"post","link":"http:\/\/139.196.114.170\/?p=615","title":{"rendered":"\u9012\u63a8\u5173\u7cfb\u5f97\u5230\u95ee\u9898\u89e3 – \u9012\u5f52\u8be6\u89e3"},"content":{"rendered":"

\u9012\u5f52\u901a\u5e38\u7528\u4e8e\u95ee\u9898\u9012\u63a8\u5f97\u89e3\uff0c\u56e0\u5176 \u57fa\u4e8e\u7528\u6237\u6808\u5b9e\u73b0\uff0c\u4e5f\u5e38\u7528\u6765\u63a7\u5236\u6267\u884c\u987a\u5e8f<\/strong>\u3002\u7531\u4e8e\u865a\u62df\u5730\u5740\u7a7a\u95f4\u7684\u5185\u5b58\u9650\u5236\uff0c\u8fc7\u591a\u7684\u8c03\u7528\u6808\u5e27\u53ef\u80fd\u89e6\u53d1\u6808\u6ea2\u51fa\/OOM\uff0c\u901a\u5e38\u5c06\u9012\u5f52\u6539\u4e3a\u8fed\u4ee3\u51cf\u5c0f\u8c03\u7528\u5f00\u9500\u907f\u514d\u3002\u672c\u6587\u7740\u91cd\u89e3\u6790\u9012\u5f52\u8c03\u7528\u601d\u60f3\u3001\u987a\u5e8f\u63a7\u5236\u548c\u8c03\u7528\u6d41\u7a0b\u8ffd\u8e2a<\/p>\n

<\/p>\n

\u9012\u5f52<\/h2>\n

\u95ee\u9898\u7684\u89e3\u82e5\u53ef\u8868\u793a\u4e3a\u9012\u63a8\u5173\u7cfb\uff0c\u5f62\u5982 \\scriptsize F(n) = G(F(n-1))<\/code>\uff0c\u95ee\u9898\u7684\u89e3\u4fbf\u53ef\u7531\u5f00\u59cb\u72b6\u6001 `$$\\scriptsize F(s) = S \u7ecf\u7531\u5173\u7cfb\u5f0f\u9012\u63a8\u5f97\u5230<\/p>\n

<\/code><\/p>\n

\u6b65\u9aa4\u4e0e\u6784\u6210<\/h3>\n

1\uff09\u627e\u5230\u95ee\u9898\u7684\u9012\u63a8\u5173\u7cfb\u5f0f \\scriptsize F(n) = G(F(n-1))<\/code>
\n2\uff09\u660e\u786e\u8fdb\u5165\u5b50\u95ee\u9898\u524d\u548c\u5b8c\u6210\u5b50\u95ee\u9898\u540e\u9700\u8981\u5b8c\u6210\u7684\u8ba1\u7b97
\n3\uff09\u660e\u786e\u5f53\u524d\u95ee\u9898\u4f20\u7ed9\u5b50\u95ee\u9898\u7684\u53c2\u6570\u3001\u83b7\u5f97\u5b50\u95ee\u9898\u7684\u7ed3\u679c\u3001\u56de\u4f20\u7236\u95ee\u9898\u7684\u7ed3\u679c
\n4\uff09\u786e\u5b9a\u9012\u5f52\u8fb9\u754c \\scriptsize F(s) = S<\/code><\/p>\n

\u903b\u8f91\u540e\u7f6e\u4e0e\u5012\u5e8f\u5904\u7406<\/h4>\n

\u9012\u5f52\u4f53\u4e2d\uff0c\u9012\u5f52\u8c03\u7528\u8fc7\u7a0b\u5148\u4e8e\u903b\u8f91\u6267\u884c\uff0c\u4ece\u800c\u4f7f\u5f97\u5f00\u59cb\u8ba1\u7b97\u672c\u5c42\u903b\u8f91\u65f6\uff0c\u540e\u5e8f\u95ee\u9898\u5747\u5df2\u8ba1\u7b97\u5b8c\u6bd5\uff1b\u4e00\u822c\u7528\u4e8e \u5012\u5e8f\u5904\u7406<\/strong><\/p>\n

\npublic Result preRecursion(Param param) {\n    \/\/ \u9012\u5f52\u8fb9\u754c\n    bound();\n\n    \/\/ \u540e\u7eed\u95ee\u9898\u8ba1\u7b97\u5148\u4e8e\u672c\u5c42\u6267\u884c\u903b\u8f91\n    Result res = preRecursion(new Param());\n\n    \/\/ \u6bcf\u5c42\u6267\u884c\u903b\u8f91\u65f6\u5747\u57fa\u4e8e\u540e\u7eed\u5df2\u8ba1\u7b97\u5b8c\u6210\u7684\u7ed3\u679c\n    Result doneResult = process(res);\n\n    \/\/ \u8fd4\u56de\u7236\u95ee\u9898\u5f53\u524d\u5c42\u5904\u7406\u7ed3\u679c\n    return doneResult;\n}\n<\/pre>\n
\u903b\u8f91\u524d\u7f6e\u4e0e\u6b63\u5e8f\u5904\u7406<\/h4>\n
\u9012\u5f52\u4f53\u4e2d\uff0c\u903b\u8f91\u6267\u884c\u5148\u4e8e\u9012\u5f52\u8c03\u7528\u8fc7\u7a0b\uff0c\u4ece\u800c\u4f7f\u5f97\u5f00\u59cb\u8ba1\u7b97\u672c\u5c42\u903b\u8f91\u65f6\uff0c\u524d\u5e8f\u95ee\u9898\u5747\u5df2\u8ba1\u7b97\u5b8c\u6bd5\uff1b\u4e00\u822c\u7528\u4e8e \u6b63\u5e8f\u5904\u7406<\/strong>\uff1b\u5168\u5c40\u95ee\u9898\u89e3\u51b3\u5b8c\u6bd5\u65f6\u5728\u6bcf\u5c42\u95ee\u9898\u672b\u5c3e\u9010\u5c42\u5411\u524d\u8fd4\u56de\u540c\u4e00\u4e2a\u7ed3\u679c\uff0c\u53c8\u79f0\u4e3a\u5c3e\u9012\u5f52<\/p>\n
\npublic Result postRecursion(Param param) {\n    \/\/ \u9012\u5f52\u8fb9\u754c\n    bound();\n\n    \/\/ \u672c\u5c42\u8fd0\u7b97\u903b\u8f91\u5148\u4e8e\u540e\u7eed\u8fd0\u7b97\n    process();\n\n    \/\/ \u540e\u5e8f\u8fd0\u7b97\u5747\u57fa\u4e8e\u5df2\u8ba1\u7b97\u7ed3\u679c\uff0c\u8fd4\u56de\u65f6\u9010\u5c42\u5411\u524d\u4f20\u9012\u95ee\u9898\u89e3\n    return postRecursion(new Param());\n}\n<\/pre>\n
\u9012\u5f52\u4e00\u822c\u5f62\u5f0f<\/h4>\n
\u7efc\u5408\u9996\u9012\u5f52\u548c\u5c3e\u9012\u5f52\uff0c\u9012\u5f52\u8c03\u7528\u524d\u7f6e\u903b\u8f91\u7528\u6765 \u57fa\u4e8e\u524d\u5e8f\u8fd0\u7b97\u6b63\u5e8f\u5904\u7406\u5143\u7d20<\/strong>\uff0c\u8c03\u7528\u540e\u7f6e\u903b\u8f91\u7528\u6765 \u57fa\u4e8e\u540e\u5e8f\u8fd0\u7b97\u5012\u5e8f\u5904\u7406\u5143\u7d20<\/strong><\/p>\n
\npublic Result recursion(Result lastResult) {\n    \/\/ \u9012\u5f52\u8fb9\u754c\n    bound();\n\n    \/\/ \u7236\u95ee\u9898\u8fdb\u5165\u5b50\u95ee\u9898\u524d\uff0c\u57fa\u4e8e\u524d\u5e8f\u8fd0\u7b97\u5df2\u5b8c\u6210\u7684\u64cd\u4f5c\n    preOperation(lastResult);\n\n    \/\/ \u7236\u95ee\u9898\u5411\u5b50\u95ee\u9898\u4f20\u5165\u9884\u5b9a\u53c2\u6570\uff0c\u5b50\u95ee\u9898\u8fd0\u7b97\u5b8c\u6bd5\u540e\u8fd4\u56de\u540e\u5e8f\u8fd0\u7b97\u7ed3\u679c\n    Result subResult = recursion(new Param());\n\n    \/\/ \u5b50\u95ee\u9898\u5904\u7406\u5b8c\u6bd5\u540e\u56de\u5230\u7236\u95ee\u9898\uff0c\u57fa\u4e8e\u540e\u5e8f\u8fd0\u7b97\u8ba1\u7b97\n    doneResult = postOperation(subResult);\n\n    \/\/ \u5411\u7236\u95ee\u9898\u8fd4\u56de\u5f53\u524d\u95ee\u9898\u5904\u7406\u5b8c\u6bd5\u7684\u7ed3\u679c\n    return doneResult;\n}\n<\/pre>\n
\u6848\u4f8b\u8be6\u6790<\/h2>\n
\u6c49\u8bfa\u5854\u95ee\u9898<\/a><\/h3>\n
\n- \u9012\u63a8\u5173\u7cfb\u5206\u6790\uff1a\n    + \u82e5\u8981\u79fb\u52a8\u6700\u4e0b\u5c42\u7684\u7b2cN\u4e2a\u5143\u7d20\uff0c\u5fc5\u987b\u5148\u79fb\u8d70\u4e0a\u9762\u66f4\u5c0f\u7684N-1\u4e2a\u5143\u7d20\uff0c\u95ee\u9898\u8f6c\u5316\u4e3a\u79fb\u52a8\u7b2cN-1\u4e2a\u5143\u7d20\u7684\u5b50\u95ee\u9898\uff1a\u7531\u4e8e\u5b50\u95ee\u9898\u5143\u7d20\u5747\u5c0f\u4e8e\u7236\u95ee\u9898\u5143\u7d20\uff0c\u6240\u4ee5\u53ea\u8981\u5148\u89e3\u51b3\u5b50\u95ee\u9898\uff0c\u5143\u7d20\u5728\u67f1\u95f4\u7684\u79fb\u52a8\u5c31\u4e0d\u4f1a\u8fdd\u53cd\u5927\u5c0f\u5173\u7cfb\n    + \u82e5\u8981\u4f7f\u8d77\u59cb\u67f1\u7684\u6700\u5927\u5143\u7d20\u7f6e\u4e8e\u76ee\u6807\u67f1\u5e95\uff0c\u76ee\u6807\u67f1\u5fc5\u7a7a\u6216\u5fc5\u5df2\u653e\u7f6e\u5f53\u524d\u6700\u5927\u5143\u7d20N\uff0c\u5373\u9650\u5236\u4e86\u66f4\u5c0f\u7684N-1\u4e2a\u5143\u7d20\u5fc5\u987b\u5168\u90e8\u4f4d\u4e8e\u4e2d\u8f6c\u67f1\n    + \u7efc\u4e0a\u7236\u95ee\u9898\u5b9a\u4e49\u4e3a\uff1a\u5c06N\u4e2a\u5143\u7d20\u7ecf\u7531\u4e2d\u8f6c\u67f1\u642c\u81f3\u76ee\u6807\u67f1\uff1b\u7236\u95ee\u9898\u5206\u89e3\u4e3a\uff1a\u4e0aN-1\u4e2a\u5143\u7d20\u4ece\u8d77\u59cb\u67f1 -> \u4e2d\u8f6c\u67f1\u3001N\u4ece\u8d77\u59cb\u67f1 -> \u76ee\u6807\u67f1\u3001\u4e0aN-1\u4e2a\u5143\u7d20\u4ece\u4e2d\u8f6c\u67f1 -> \u76ee\u6807\u67f1\n- \u660e\u786e\u9012\u5f52\u8fb9\u754c\uff1a\n    + \u5f53\u524d\u5143\u7d20\u662f\u9876\u7aef\u6700\u5c0f\u5143\u7d20\u65f6\uff08\u6b64\u65f6N=1\uff09\uff0c\u5c06\u5176\u4ece\u8c03\u7528\u65f6\u7684\u6e90\u67f1\u9876\u7aef\u79fb\u81f3\u76ee\u6807\u67f1\n- \u903b\u8f91\u653e\u7f6e\u987a\u5e8f\uff1a\n    + \u4e2d\u8f6cN-1\u5143\u7d20\u5b50\u95ee\u9898 \u524d\u7f6e\u4e8e \u79fb\u52a8\u672c\u5c42\u6700\u5927\u5143\u7d20\u903b\u8f91\uff1a\u4fdd\u8bc1\u5148\u5904\u7406\u66f4\u5c0f\u5143\u7d20\uff0c\u4ee5\u53ca\u5012\u5e8f\u56de\u5230\u672c\u5c42\u903b\u8f91\u65f6\uff0cN-1\u4e2a\u5143\u7d20\u5747\u642c\u8fd0\u5b8c\u6bd5\n    + \u56de\u4f20N-1\u5143\u7d20\u5b50\u95ee\u9898 \u540e\u7f6e\u4e8e \u79fb\u52a8\u672c\u5c42\u6700\u5927\u5143\u7d20\u903b\u8f91\uff1a\u4fdd\u8bc1\u6b63\u5e8f\u5904\u7406\u5b50\u95ee\u9898\u65f6\uff0c\u76ee\u6807\u67f1\u5f53\u524d\u9876\u5c42\u5df2\u7ecf\u662f\u5f53\u524d\u6700\u5927\u5143\u7d20\uff0c\u4e14\u5728\u79fb\u52a8N-1\u4e2a\u5143\u7d20\u65f6\uff0c\u4ecd\u7136\u4fdd\u8bc1\u5148\u5904\u7406\u66f4\u5c0f\u5143\u7d20\n<\/pre>\n
\\tiny\n\u6c49\u8bfa\u5854\u95ee\u9898\u7684\u8c03\u7528\u6b21\u6570\u63a8\u5bfc\u5982\u4e0b\uff1a\\\\\n \u9012\u5f52\u8c03\u7528\u540c\u6ee1\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386\uff0c\u8c03\u7528\u6b21\u6570\u540c\u5176\u8282\u70b9\u6570\u91cf\uff0c\u6ee1\u8db3\u9012\u63a8\u5173\u7cfb\\\\\na_n = 2a_{n-1} + 1, a_1 = 1\\\\\n\u5219a_n\u901a\u9879\u53ef\u4f5c\u5982\u4e0b\u63a8\u5bfc\\\\\na_n = 2a_{n-1} + 1  \\\\\n= 2(2a_{n-2} + 1) + 1\\\\\n= 2^{n-1}a_1 + (1+2+2^2+\\cdots+2^{n-2})\\\\\n= 2^{n-1} + 2^{n-1} - 1\\\\\n= 2^n - 1<\/code><\/pre>\n
\u4e09\u9636\u6c49\u8bfa\u5854\u95ee\u9898\u7684\u9012\u5f52\u8c03\u7528\u8ffd\u8e2a\u5982\u4e0b\uff0c\u8bfb\u8005\u53ef\u81ea\u884c\u753b\u51fa4\u9636\u8c03\u7528\u8f68\u8ff9\u65b9\u4fbf\u7406\u89e3
\n\"hanoi\"<\/p>\n
class Solution {\n    public void hanota(List<Integer> A, List<Integer> B, List<Integer> C) {\n        int n = A.size();\n        move(n, A, B, C);\n    }\n\n    \/**\n     * \u628a\u6700\u5927\u5143\u7d20\u4e0a\u9762\u7684n-1\u4e2a\u5143\u7d20\u4ecesrc\u7ecf\u7531tmp\u79fb\u81f3tar\n     *\/\n    public void move(int n, List<Integer> src, List<Integer> tmp, List<Integer> tar) {\n\n        \/\/ \u9012\u5f52\u8fb9\u754c\uff0c\u5c06\u672c\u5c42\u8d77\u59cb\u67f1\u9876\u7aef\u5143\u7d20\u79fb\u81f3\u76ee\u6807\u67f1\u9876\u7aef\n        if (n == 1) {\n            tar.add(src.remove(src.size() - 1));\n            return;\n        }\n\n        \/\/ \u5c06\u672c\u5c42\u6700\u5927\u5143\u7d20\u4e0a\u9762\u7684n-1\u4e2a\u5143\u7d20\u4ecesrc\u79fb\u5230tmp\n        move(n - 1, src, tar, tmp);\n\n        \/\/ \u5c06\u672c\u5c42\u6700\u5927\u5143\u7d20\u4ecesrc\u79fb\u5230tar\uff0c\u672c\u5c42\u6700\u5927\u662fsrc[src.size() - 1]\uff0c\u975e\u5168\u5c40\u6700\u5927src[0]\n        tar.add(src.remove(src.size() - 1));\n\n        \/\/ \u628a\u6700\u5927\u5143\u7d20\u4e0a\u9762\u7684n-1\u4e2a\u5143\u7d20\u4ecetmp\u79fb\u5230tar\n        move(n - 1, tmp, src, tar);\n    }\n}<\/code><\/pre>\n
\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u7ed3\u70b9<\/a><\/h3>\n
\n    \u5206\u6790\n        > \u7236\u5b50\u95ee\u9898\u9012\u63a8\n            \u7236\u95ee\u9898 -> head -> next -> \u5b50\u95ee\u9898\n            \u7236\u95ee\u9898 -> next -> head -> \u5b50\u95ee\u9898\n            \u6bcf\u4e00\u5c42\u8fd4\u7ed9\u7236\u95ee\u9898\u5934\u7ed3\u70b9\uff0c\u62ff\u5230\u5b50\u95ee\u9898\u5934\u7ed3\u70b9\n        > \u6bcf\u5c42\u6838\u5fc3\u903b\u8f91\n            \u4ea4\u6362\u4e24\u4e2a\u7ed3\u70b9\uff0c\u8fd4\u56de\u5f53\u524d\u5934\u7ed3\u70b9\u7ed9\u7236\u95ee\u9898\uff0c\u6307\u5411\u5b50\u7ed3\u70b9\u8fd4\u56de\u7684\u5934\u7ed3\u70b9\n        > \u9012\u5f52\u8fb9\u754c\n            \u7a7a\u7ed3\u70b9\u6216\u53ea\u5269\u4e00\u4e2a\u7ed3\u70b9\u65e0\u6cd5\u4ea4\u6362\n<\/pre>\n
    public class ListNode {\n        int val;\n        ListNode next;\n        ListNode(int x) { val = x; }\n    }\n\n    class Solution {\n        public ListNode swapPairs(ListNode head) {\n            if(head == null || head.next == null){\n                return head;\n            }\n            ListNode next = head.next;\n            head.next = swapPairs(next.next);\n            next.next = head;\n            return next;\n        }\n    }<\/code><\/pre>\n
\u6570\u5b57\u56de\u6587\u5e8f\u5217<\/h3>\n
    public void mystery(int x) {\n        System.out.print(x % 10);\n        if ((x \/ 10) != 0) {\n            mystery(x \/ 10);\n        }\n        System.out.print(x % 10);\n    }<\/code><\/pre>\n
\n> 1234\n43211234\n<\/pre>\n
\u6768\u8f89\u4e09\u89d2<\/h3>\n
\n    > \u9012\u63a8\u5173\u7cfb\n        if(j == 0 || j == i) father.add(1);\n        else father.add(sub.get(j-1) + sub.get(j));\n<\/pre>\n
\u2460 [\u6539\u8fdb] \u4ece\u9996\u884c\u5f00\u59cb\u6bcf\u6b21\u4fdd\u5b58\u4e0a\u884c\u7ed3\u679c\u4f9b\u5f53\u524d\u884c\u8ba1\u7b97\uff0c\u907f\u514d\u9012\u51cf\u9012\u5f52\u9020\u6210\u7684\u91cd\u590d\u8ba1\u7b97<\/p>\n
    public static List<Integer> getRow(int rowIndex) {\n        List<Integer> pre = new ArrayList<Integer>();\n        for (int i = 1; i <= rowIndex; i++) {\n            List<Integer> now = new ArrayList<Integer>();\n            for (int j = 0; j < i; j++) {\n                if (j == 0 || j == i - 1) now.add(1);\n                else now.add(pre.get(j - 1) + pre.get(j));\n            }\n            pre = now;\n        }\n        return pre;\n    }<\/code><\/pre>\n
\u2461 [\u6539\u8fdb] \u590d\u7528\u540c\u4e00\u4e2alist\uff0c\u51cf\u5c11\u65b0\u5efalist\u5f00\u9500<\/p>\n
    public static List<Integer> getRow(int n) {\n        List<Integer> res = new ArrayList<>(n);\n        res.add(1);\n        int pre = res.get(0);\n        for (int i = 1; i <= n; i++) {\n            for (int j = 1; j < i; j++) {\n                int tmp = res.get(j);\n                res.set(j, tmp + pre);\n                pre = tmp;\n            }\n            res.add(1);\n        }\n        return res;\n    }<\/code><\/pre>\n
\u2462 [\u6539\u8fdb] \u5012\u5e8f\u53bb\u9664\u8986\u76d6\uff0c\u51cf\u5c11\u4e2d\u95f4\u53d8\u91cf\u5f00\u9500<\/p>\n
    public static List<Integer> getRow(int n) {\n        List<Integer> res = new ArrayList<>(n);\n        res.add(1);\n        int pre = res.get(0);\n        for (int i = 1; i < n; i++) {\n            for (int j = i - 1; j > 0; j--) {\n                cur.set(j, cur.get(j - 1) + cur.get(j));\n            }\n            cur.add(1);\n        }\n        return res;\n    }<\/code><\/pre>\n
\u2463 [\u8ba1\u7b97] \u7ec4\u5408\u6570\u516c\u5f0f<\/p>\n
    public List<Integer> getRow(int rowIndex) {\n        List<Integer> ans = new ArrayList<>();\n        int n = rowIndex;\n        for (int k = 0; k <= n; k++)\n            ans.add(C(n, k));\n        return ans;\n    }\n\n    private int C(int n, int k) {\n        long res = 1;\n        for (int i = 1; i <= k; i++)\n            res = res * (n - k + i) \/ i;\n        return (int) res;\n    }<\/code><\/pre>\n
\u2464 [\u8ba1\u7b97] \u7ec4\u5408\u6570\u516c\u5f0f\u7b80\u5316<\/p>\n
    public List<Integer> getRow(int rowIndex) {\n        List<Integer> res = new ArrayList<>();\n        int n = rowIndex;\n        long pre = 1;\n        ans.add(1);\n        for (int k = 1; k <= N; k++) {\n            long now = pre * (n - k + 1) \/ k;\n            ans.add((int) now);\n            pre = now;\n        }\n        return res;\n    }<\/code><\/pre>\n
\n
\u4e0a\u8ff0\u82e5\u91c7\u7528pre*=(n-k+1)\/k\uff0c\u53f3\u4fa7\u7ed3\u679c\u5148\u8ba1\u7b97\u4e3a0\uff0c\u5bfc\u81f4\u672b\u4f4d\u4e3a0
\n\u53ef\u5229\u7528\u5bf9\u79f0\u6027\u8fdb\u884c\u8fdb\u4e00\u6b65\u4f18\u5316<\/p>\n<\/blockquote>\n
\u53cd\u8f6c\u94fe\u8868<\/h3>\n
\u5206\u6790\n    > \u7236\u5b50\u95ee\u9898\u9012\u63a8\n        \u5b50\u95ee\u9898\u8fd4\u56de\u540e\u4e00\u7ed3\u70b9 -> \u5f53\u524d\u7ed3\u70b9 -> \u8fd4\u56de\u7236\u95ee\u9898\u5934\/\u5c3e\u7ed3\u70b9\n    > \u9012\u5f52\u8fb9\u754c\n        \u7a7a\u7ed3\u70b9\u8fd4\u56de\u7a7a\u6216\u53ea\u5269\u4e00\u4e2a\u7ed3\u70b9\u8fd4\u56de\u8be5\u7ed3\u70b9<\/code><\/pre>\n
\u2460 [\u9012\u5f52] \u8fd4\u56de\u7236\u95ee\u9898\u5934\u8282\u70b9\uff0c\u6bcf\u6b21\u63d2\u5165\u9700\u8981\u904d\u5386\u5230\u5c3e\u8282\u70b9<\/p>\n
    public ListNode reverseList(ListNode head) {\n        if (head == null || head.next == null) return head;\n        ListNode node = reverseList(head.next);\n        head.next = null;\n        ListNode temp = node;\n        while (temp.next != null) temp = temp.next;\n        temp.next = head;\n        return node;\n    }<\/code><\/pre>\n
\u2461 [\u9012\u5f52] \u8fd4\u56de\u7236\u95ee\u9898\u5c3e\u8282\u70b9\uff0c\u4e00\u4e2a\u9644\u52a0\u7ed3\u70b9\u4fdd\u5b58\u5934\u7ed3\u70b9\uff0c\u907f\u514d\u904d\u5386<\/p>\n
    private static ListNode headNode = null;\n    public static ListNode reverseList(ListNode head) {\n        if (head == null || head.next == null) return headNode = head;\n        ListNode node = reverseList(head.next);\n        head.next = null;\n        node.next = head;\n        return head;\n    }<\/code><\/pre>\n
\u2462 [\u9012\u5f52] \u6bcf\u4e00\u6b65\u6307\u5411\u4e4b\u524d\u7ed3\u70b9\uff0c\u6bcf\u4e00\u6b65\u90fd\u8fd4\u7ed9\u7236\u95ee\u9898\u7ed3\u679c\u7684\u5934\u7ed3\u70b9<\/p>\n
    public ListNode reverseList(ListNode head) {\n        if (head == null || head.next == null) return head;\n        ListNode p = reverseList(head.next);\n        head.next.next = head;\n        head.next = null;\n        return p;\n    }<\/code><\/pre>\n
\u2463 [\u5c3e\u9012\u5f52] \u8fd4\u56de\u7236\u95ee\u9898\u5934\u7ed3\u70b9\uff0c\u4fdd\u5b58\u4e0a\u4e00\u7ed3\u70b9\u4f9b\u6307\u5411\u548cnext\u6307\u9488\u4f9b\u5411\u540e\u904d\u5386<\/p>\n
    public ListNode reverseList(ListNode head) {\n        return reverse(null,head);\n    }\n\n    private static ListNode reverse(ListNode pre,ListNode cur){\n        if(cur == null) return pre;\n        ListNode next = cur.next;\n        cur.next = pre;\n        return reverse(cur,next);\n    }<\/code><\/pre>\n
\u5168\u6392\u5217\u95ee\u9898<\/h3>\n
\u7ed9\u5b9an\u4e2a\u5b57\u7b26\uff0c\u6c42\u5176\u5b57\u5178\u5e8f\/\u5347\u5e8f\u5168\u6392\u5217<\/p>\n
\u5b57\u5178\u5e8f[\u66b4\u529b\u6c42\u89e3]<\/h4>\n
1.\u95ee\u9898\u5206\u89e3\uff1a\n    \u679a\u4e3e\u5f53\u524d\u5b57\u7b26 \u679a\u4e3e\u4e0b\u4e00\u4e2a\u5b57\u7b26\n2.\u95ee\u9898\u6a21\u5f0f\uff1a\n    \u5168\u6392\u5217 = \u5f53\u524d\u679a\u4e3e\u5b57\u7b26 + \u4e0d\u542b\u5f53\u524d\u6240\u6709\u5b57\u7b26\u7684\u679a\u4e3e\n3.\u9012\u5f52\u8fb9\u754c\uff1a\n    \u679a\u4e3e\u5230\u8fbe\u7ed9\u5b9a\u5b57\u7b26\u96c6\u672b\u5c3e\n4.\u6838\u5fc3\u64cd\u4f5c\n    \u6309\u5e8f\u904d\u5386\u5b57\u7b26\u96c6\uff0c\u8bbe\u5b9a\u672a\u51fa\u73b0\u5b57\u7b26\u4e3a\u4e0b\u4e00\u4e2a\u5b57\u7b26<\/code><\/pre>\n
- \u4ee3\u7801\u6d41\u7a0b\n    -1\n        -1 \u00d7\n        -2 \u221a\n            -1 \u00d7\n            -2 \u00d7\n            -3 \u221a\n        -3 \u221a\n            -1 \u00d7\n            -2 \u221a\n            -3 \u00d7\n    -2\n        -1 \u221a\n            -1 \u00d7\n            -2 \u00d7\n            -3 \u221a\n        -2 \u00d7\n        -3 \u221a\n            -1 \u221a\n            -2 \u00d7\n            -3 \u00d7\n    -3\n        -1 \u221a\n            -1 \u00d7\n            -2 \u221a\n            -3 \u00d7\n        -2 \u221a\n            -1 \u221a\n            -2 \u00d7\n            -3 \u00d7\n        -3 \u00d7<\/code><\/pre>\n
    private static char[] arr = new char[]{'c', 'b', 'a'};\n\n    public static void main(String[] args) {\n        char[] des = new char[arr.length];\n        Arrays.sort(arr);\n        permutation(des, 0);\n    }\n\n    public static void permutation(char[] des, int cur) {\n        if (cur == des.length) {\n            System.out.println(Arrays.toString(des));\n        }\n        for (char item : arr) {\n            int i = 0;\n            for (; i < cur; i++) {\n                if (des[i] == item) {\n                    break;\n                }\n            }\n            if (i == cur) {\n                des[cur] = item;\n                permutation(des, cur + 1);\n            }\n        }\n    }<\/code><\/pre>\n
[a, b, c]\n[a, c, b]\n[b, a, c]\n[b, c, a]\n[c, a, b]\n[c, b, a]<\/code><\/pre>\n
\u975e\u5b57\u5178\u5e8f[\u9012\u5f52\u4ea4\u6362]<\/h4>\n
\u5206\u6790\n    > \u7236\u5b50\u95ee\u9898\u9012\u63a8\n        \u7236\u95ee\u9898 = \u9009\u5b9a\u67d0\u5b57\u7b26\u5f00\u5934 + \u5b50\u95ee\u9898\u9664\u8be5\u5b57\u7b26\u5df2\u6392\u5217\u7ed3\u679c \u5e76\u8fd8\u539f\u9009\u5b9a\u524d\u72b6\u6001\n    > \u6bcf\u5c42\u6838\u5fc3\u903b\u8f91\n        \u5728\u5b50\u95ee\u9898\u5df2\u6392\u597d\u57fa\u7840\u524d\u679a\u4e3e\u6bcf\u4e2a\u5b57\u7b26\uff0c\u5c06\u5f53\u524d\u5c42\u6392\u5217\u597d\u7684\u57fa\u7840\u4f20\u7ed9\u7236\u95ee\u9898<\/code><\/pre>\n
- \u4ee3\u7801\u6d41\u7a0b\n    -1\u4e0e1\u4ea4\u6362\u9996\u4f4d\n        -2\u4e0e3\u4ea4\u6362\u9996\u4f4d\n        -2\u4e0e3\u4ea4\u6362\u6062\u590d\u539f\u4f4d\n    -1\u4ea4\u6362\u6062\u590d\u539f\u4f4d\n    -2\u4e0e1\u4ea4\u6362\u9996\u4f4d\n        -1\u4e0e3\u4ea4\u6362\u9996\u4f4d\n        -1\u4e0e3\u4ea4\u6362\u6062\u590d\u539f\u4f4d\n    -2\u4ea4\u6362\u6062\u590d\u539f\u4f4d\n    -3\u4e0e1\u4ea4\u6362\u9996\u4f4d\n        -2\u4e0e3\u4ea4\u6362\u9996\u4f4d\n        -2\u4e0e3\u4ea4\u6362\u6062\u590d\u539f\u4f4d\n    -3\u4ea4\u6362\u6062\u590d\u539f\u4f4d<\/code><\/pre>\n
    public static void main(String[] args) {\n        char[] arr = new char[]{'1', '2', '3', '4'};\n        int end = arr.length - 1;\n        permutation(arr, 0, end);\n    }\n\n    public static void permutation(char[] arr, int cur, int end) {\n        if (cur == end) {\n            System.out.println(Arrays.toString(arr));\n            return;\n        }\n        for (int i = cur; i <= end; i++) {\n            swap(arr, i, cur);\n            permutation(arr, cur + 1, end);\n            swap(arr, i, cur);\n        }\n    }\n\n    public static void swap(char[] arr, int cur, int end) {\n        char temp = arr[cur];\n        arr[cur] = arr[end];\n        arr[end] = temp;\n    }<\/code><\/pre>\n
- \u5b9e\u9645\u6d41\u7a0b\n    -1\n        -2\n            -3\n                4\n            -4\n                3\n        -3\n            -2\n                -4\n            -4\n                -2\n        -4\n            -3\n                -2\n            -2\n                -3\n    -2\n        -1\n            -3\n                -4\n            -4\n                -3\n        -3\n            -1\n                -4\n            -4\n                -1\n        -4\n            -3\n                -2\n            -1\n                -3\n    -3\n        -2\n            -1\n                -4\n            -4\n                -1\n        -1\n            -2\n                -4\n            -4\n                -2\n        -4\n            -1\n                -2\n            -2\n                -1\n    -4\n        -2\n            -3\n                -1\n            -1\n                -3\n        -3\n            -2\n                -1\n            -1\n                -2\n        -1\n            -3\n                -2\n            -2\n                -3<\/code><\/pre>\n
\u8bb0\u5fc6\u5316<\/h2>\n
\u5c06\u7b2c\u4e00\u6b21\u7684\u8ba1\u7b97\u7ed3\u679c\u5b58\u50a8\u5728\u54c8\u5e0c\u8868\u4e2d\uff0c\u901a\u8fc7\u67e5\u8868\u6cd5\u907f\u514d\u9012\u5f52\u4e2d\u7684\u91cd\u590d\u8fd0\u7b97<\/code><\/pre>\n
\u6590\u6ce2\u90a3\u5951\u6570\u5217<\/h3>\n
\u2460 \u9012\u5f52\u54c8\u5e0c\u8868\u7f13\u5b58\u51cf\u5c11\u8ba1\u7b97\u6210\u672c<\/p>\n
    public static HashMap<Integer, Integer> cache = new HashMap<>();\n    public static int fib(int N) {\n        if (cache.containsKey(N)) return cache.get(N);\n        int result;\n        if (N < 2) result = N;\n        else result = fib(N - 1) + fib(N - 2);\n        cache.put(N, result);\n        return result;\n    }<\/code><\/pre>\n
\u2461 \u6590\u6ce2\u90a3\u5951\u6570\u539f\u59cb\u8ba1\u7b97\u65b9\u6cd5<\/p>\n
    public int climbStairs(int n) {\n        if(n < 3) return n;\n        int result0 = 0;\n        int result1 = 1;\n        int result = 0;\n        for(int i = 2; i <= n; i++){\n            result = result1 + result0;\n            result0 = result1;\n            result1 = result;\n        }\n        return result;\n    }<\/code><\/pre>\n
\u2462 \u6590\u6ce2\u90a3\u5951\u6570\u5217\u8ba1\u7b97\u516c\u5f0f<\/p>\n
    public int climbStairs(int n) {\n        double sqrt5 = Math.sqrt(5);\n        double fib = Math.pow((1 + sqrt5) \/ 2, n + 1) - Math.pow((1 - sqrt5) \/ 2, n + 1);\n        return (int)(fib \/ sqrt5);\n    }<\/code><\/pre>\n
\u722c\u697c\u68af<\/h3>\n
LeetCode70<\/a><\/p>\n
\u5206\u6790\n    \u5f53\u524d\u4f4d\u7f6e\u79cd\u6570 = \u9000\u4e00\u6b65\u6570\u4f4d\u7f6e\u79cd\u6570 + \u9000\u4e24\u6b65\u6570\u4f4d\u7f6e\u79cd\u6570\n    \u9012\u5f52\u8fb9\u754c \u8d70\u4e00\u6b651=1\uff0c\u8d70\u4e24\u6b652=1+1\u62162=2\n    \u5b9e\u9645\u6570\u5b57\u89c4\u5f8b\u4e3a\u6590\u6ce2\u90a3\u5951\u6570\u5217\uff0c\u53ef\u7528\u4e0a\u4f8b\u6240\u6709\u65b9\u6cd5<\/code><\/pre>\n
\u2460 \u7f13\u5b58\u9012\u5f52<\/p>\n
    Map<Integer, Integer> cache = new HashMap<Integer, Integer>();\n    public int climbStairs(int n) {\n        if(cache.containsKey(n)) return cache.get(n);\n        int result;\n        if(n < 3) result = n;\n        else result = climbStairs(n - 1) + climbStairs(n - 2);\n        cache.put(n, result);\n        return result;\n    }<\/code><\/pre>\n
\u2461 \u52a8\u6001\u89c4\u5212<\/p>\n
    public static int climbStairs(int n) {\n        if(n < 3) return n;\n        int[] dp = new int[n];\n        dp[0] = 1;\n        dp[1] = 2;\n        for (int i = 2; i < n; i++)\n            dp[i] = dp[i - 1] + dp[i - 2];\n        return dp[n - 1];\n    }<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u9012\u5f52\u901a\u5e38\u7528\u4e8e\u95ee\u9898\u9012\u63a8\u5f97\u89e3\uff0c\u56e0\u5176 \u57fa\u4e8e\u7528\u6237\u6808\u5b9e\u73b0\uff0c\u4e5f\u5e38\u7528\u6765\u63a7\u5236\u6267\u884c\u987a\u5e8f\u3002\u7531\u4e8e\u865a\u62df\u5730\u5740\u7a7a\u95f4\u7684\u5185\u5b58\u9650\u5236\uff0c\u8fc7\u591a\u7684\u8c03\u7528\u6808 … <\/p>\n
\u7ee7\u7eed\u9605\u8bfb\u201c\u9012\u63a8\u5173\u7cfb\u5f97\u5230\u95ee\u9898\u89e3 – \u9012\u5f52\u8be6\u89e3\u201d<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[12],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/615"}],"collection":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=615"}],"version-history":[{"count":41,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/615\/revisions"}],"predecessor-version":[{"id":2740,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/615\/revisions\/2740"}],"wp:attachment":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=615"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=615"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=615"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}