René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[512-Week 05]学习总结","articleBody":"动态规划\r\n\r\n递归代码模板\r\n\r\npublic void recur(int level, int param) {\r\n// terminator\r\nif (level \u003e MAX_LEVEL) {\r\n// process result\r\nreturn;\r\n}\r\n// process current logic\r\nprocess(level, param);\r\n// drill down\r\nrecur( level: level + 1, newParam);\r\n// restore current status\r\n}\r\n\r\n分治 Divide \u0026 Conquer\r\n\r\ndef divide_conquer(problem, param1, param2, ...):\r\nrecursion terminator\r\nif problem is None:\r\nprint_result\r\nreturn\r\n\r\nprepare data\r\ndata = prepare_data(problem)\r\nsubproblems = split_problem(problem, data)\r\n\r\nconquer subproblems\r\nsubresult1 = self.divide_conquer(subproblems[0], p1, ...)\r\nsubresult2 = self.divide_conquer(subproblems[1], p1, ...)\r\nsubresult3 = self.divide_conquer(subproblems[2], p1, ...)\r\n…\r\n\r\nprocess and generate the final result\r\nresult = process_result(subresult1, subresult2, subresult3, …)\r\nrevert the current level states\r\n\r\n动态规划和递归或者分治没有根本上的区别(关键看有无最优的子结构)\r\n共性：找到重复子问题\r\n差异性：最优子结构，中途可以淘汰次优解","author":{"url":"https://github.com/ZhaoJing99","@type":"Person","name":"ZhaoJing99"},"datePublished":"2020-04-19T13:51:59.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/1341/algorithm006-class02/issues/1341"}