Title: [512-Week 08]学习总结 · Issue #1338 · algorithm006-class02/algorithm006-class02 · GitHub
Open Graph Title: [512-Week 08]学习总结 · Issue #1338 · algorithm006-class02/algorithm006-class02
X Title: [512-Week 08]学习总结 · Issue #1338 · algorithm006-class02/algorithm006-class02
Description: 分制,回溯,动态规划本质都是递归。 分制: 把大的重复问题分解为小的子问题 动态规划: 分治 + 最优子结构:一般都会求最优解,最大值,或者最少的方式 Dynamic Programming:动态写程序,动态递推 有每一步的最优子结构,就不需要每一步都会保留中间子结构的状态,会淘汰次优解,只保留最优或者次优的
Open Graph Description: 分制,回溯,动态规划本质都是递归。 分制: 把大的重复问题分解为小的子问题 动态规划: 分治 + 最优子结构:一般都会求最优解,最大值,或者最少的方式 Dynamic Programming:动态写程序,动态递推 有每一步的最优子结构,就不需要每一步都会保留中间子结构的状态,会淘汰次优解,只保留最优或者次优的
X Description: 分制,回溯,动态规划本质都是递归。 分制: 把大的重复问题分解为小的子问题 动态规划: 分治 + 最优子结构:一般都会求最优解,最大值,或者最少的方式 Dynamic Programming:动态写程序,动态递推 有每一步的最优子结构,就不需要每一步都会保留中间子结构的状态,会淘汰次优解,只保留最优或者次优的
Opengraph URL: https://github.com/algorithm006-class02/algorithm006-class02/issues/1338
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[512-Week 08]学习总结","articleBody":"分制,回溯,动态规划本质都是递归。\r\n分制:\r\n把大的重复问题分解为小的子问题\r\n动态规划:\r\n分治 + 最优子结构:一般都会求最优解,最大值,或者最少的方式\r\nDynamic Programming:动态写程序,动态递推\r\n有每一步的最优子结构,就不需要每一步都会保留中间子结构的状态,会淘汰次优解,只保留最优或者次优的","author":{"url":"https://github.com/ZhaoJing99","@type":"Person","name":"ZhaoJing99"},"datePublished":"2020-04-19T13:38:22.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/1338/algorithm006-class02/issues/1338"}
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:691a9a58-8860-1199-1991-5c7fe8b91a8e |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | E09A:2F8072:26AA363:3502013:6A4ED56B |
| html-safe-nonce | 9b60a74dde98cb5f3f99b060f39830d988b217d4bd496f469aedc74f5133dcc8 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJFMDlBOjJGODA3MjoyNkFBMzYzOjM1MDIwMTM6NkE0RUQ1NkIiLCJ2aXNpdG9yX2lkIjoiMzEzMjMxODI4NDk1Njc1MTIxMiIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | e28204c59ba2af372982d1396e80145b80b2d04f2a4ca6dbba7683dd2201b6a5 |
| hovercard-subject-tag | issue:602717142 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/algorithm006-class02/algorithm006-class02/1338/issue_layout |
| twitter:image | https://opengraph.githubassets.com/2fae2a779ba9d2987055c02e6b45fb89305ba5ecbe1c71de522dd1878bc3cd80/algorithm006-class02/algorithm006-class02/issues/1338 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/2fae2a779ba9d2987055c02e6b45fb89305ba5ecbe1c71de522dd1878bc3cd80/algorithm006-class02/algorithm006-class02/issues/1338 |
| og:image:alt | 分制,回溯,动态规划本质都是递归。 分制: 把大的重复问题分解为小的子问题 动态规划: 分治 + 最优子结构:一般都会求最优解,最大值,或者最少的方式 Dynamic Programming:动态写程序,动态递推 有每一步的最优子结构,就不需要每一步都会保留中间子结构的状态,会淘汰次优解,只保留最优或者次优的 |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | ZhaoJing99 |
| hostname | github.com |
| expected-hostname | github.com |
| None | 41b6ab3ba6d20a71766ac245b5a4a94c6fc672a9cd4da7d44c1b33ab8bf6a21c |
| turbo-cache-control | no-preview |
| go-import | github.com/algorithm006-class02/algorithm006-class02 git https://github.com/algorithm006-class02/algorithm006-class02.git |
| octolytics-dimension-user_id | 60603935 |
| octolytics-dimension-user_login | algorithm006-class02 |
| octolytics-dimension-repository_id | 237938479 |
| octolytics-dimension-repository_nwo | algorithm006-class02/algorithm006-class02 |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 237938479 |
| octolytics-dimension-repository_network_root_nwo | algorithm006-class02/algorithm006-class02 |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | c37fe3e3f5f306900bd5b6bee97463f66c938b2c |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width