payload: {"action":"created","issue":{"url":"https://api.github.com/repos/algorithm003/algorithm/issues/114","repository_url":"https://api.github.com/repos/algorithm003/algorithm","labels_url":"https://api.github.com/repos/algorithm003/algorithm/issues/114/labels{/name}","comments_url":"https://api.github.com/repos/algorithm003/algorithm/issues/114/comments","events_url":"https://api.github.com/repos/algorithm003/algorithm/issues/114/events","html_url":"https://github.com/algorithm003/algorithm/issues/114","id":462111581,"node_id":"MDU6SXNzdWU0NjIxMTE1ODE=","number":114,"title":"算法训练营（深圳站）第三周作业","user":{"login":"GeekUniversity","id":48476253,"node_id":"MDQ6VXNlcjQ4NDc2MjUz","avatar_url":"https://avatars0.githubusercontent.com/u/48476253?v=4","gravatar_id":"","url":"https://api.github.com/users/GeekUniversity","html_url":"https://github.com/GeekUniversity","followers_url":"https://api.github.com/users/GeekUniversity/followers","following_url":"https://api.github.com/users/GeekUniversity/following{/other_user}","gists_url":"https://api.github.com/users/GeekUniversity/gists{/gist_id}","starred_url":"https://api.github.com/users/GeekUniversity/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/GeekUniversity/subscriptions","organizations_url":"https://api.github.com/users/GeekUniversity/orgs","repos_url":"https://api.github.com/users/GeekUniversity/repos","events_url":"https://api.github.com/users/GeekUniversity/events{/privacy}","received_events_url":"https://api.github.com/users/GeekUniversity/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":205,"created_at":"2019-06-28T16:19:19Z","updated_at":"2019-07-28T11:58:02Z","closed_at":null,"author_association":"CONTRIBUTOR","body":"# 要求\r\n\r\n1. 每周至少完成给定题目中的两道算法题\r\n2. 围绕每周重点学习的算法知识点，撰写一篇有观点和思考的技术文章（字数不限）\r\n\r\n# 注意事项\r\n\r\n1. 下面列出的题目中，按照知识点进行了简单分类，但并不意味着使用相应的数据结构或算法一定是解决该题目的最优解，这样分类只是为了方便大家有针对性的练习；\r\n2. 有的题目可能需要结合多个算法或数据结构进行求解。\r\n\r\n# 第三周题目\r\n\r\n## 图\r\n\r\n中等：https://leetcode.com/problems/number-of-islands/\r\n中等：https://leetcode-cn.com/problems/course-schedule-ii\r\n\r\n## 堆和排序\r\n\r\n简单：https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/\r\n困难：https://leetcode-cn.com/problems/find-median-from-data-stream/\r\n\r\n## DFS\r\n\r\n简单：https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/\r\n简单：https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/\r\n中等：https://leetcode-cn.com/problems/friend-circles/\r\n中等：https://leetcode-cn.com/problems/find-eventual-safe-states/\r\n困难：https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix/\r\n困难：https://leetcode-cn.com/problems/minesweeper/\r\n困难：https://leetcode-cn.com/problems/word-ladder/\r\n\r\n## BFS\r\n\r\n简单：https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/\r\n简单：https://leetcode-cn.com/problems/binary-tree-level-order-traversal/\r\n简单：https://leetcode.com/problems/binary-tree-level-order-traversal-ii/\r\n中等：https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/\r\n中等：https://leetcode-cn.com/problems/minesweeper/\r\n中等：https://leetcode-cn.com/problems/minimum-height-trees/\r\n\r\n# 作业提交规则\r\n\r\n1. 在提交作业之前，请先阅读这里的 README 文档：\r\nhttps://github.com/algorithm002/algorithm/blob/master/README.md\r\n2. 然后在此 Issues 下按照如下格式回复:\r\n> #作业提交\r\n> 学号：\r\n> username：\r\n> 代码作业：（填写自己仓库下对应的作业链接即可，同时记得给本仓库提交 pull request）\r\n> 学习总结：发表自己本周的学习感言  issues，并提交链接，issues 标题格式：“【学号后三位-week1】+文章标题”，格式参考：https://github.com/algorithm003/algorithm/issues/2\r\n> 使用语言："},"comment":{"url":"https://api.github.com/repos/algorithm003/algorithm/issues/comments/515756683","html_url":"https://github.com/algorithm003/algorithm/issues/114#issuecomment-515756683","issue_url":"https://api.github.com/repos/algorithm003/algorithm/issues/114","id":515756683,"node_id":"MDEyOklzc3VlQ29tbWVudDUxNTc1NjY4Mw==","user":{"login":"cc1901","id":831672,"node_id":"MDQ6VXNlcjgzMTY3Mg==","avatar_url":"https://avatars2.githubusercontent.com/u/831672?v=4","gravatar_id":"","url":"https://api.github.com/users/cc1901","html_url":"https://github.com/cc1901","followers_url":"https://api.github.com/users/cc1901/followers","following_url":"https://api.github.com/users/cc1901/following{/other_user}","gists_url":"https://api.github.com/users/cc1901/gists{/gist_id}","starred_url":"https://api.github.com/users/cc1901/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cc1901/subscriptions","organizations_url":"https://api.github.com/users/cc1901/orgs","repos_url":"https://api.github.com/users/cc1901/repos","events_url":"https://api.github.com/users/cc1901/events{/privacy}","received_events_url":"https://api.github.com/users/cc1901/received_events","type":"User","site_admin":false},"created_at":"2019-07-28T11:58:02Z","updated_at":"2019-07-28T11:58:02Z","author_association":"NONE","body":"> > #作业提交\r\n> > 学号：033\r\n> > username：杨帆\r\n> > 代码作业：https://github.com/yyyyfan/algorithm/tree/master/Week_03/id_33\r\n> > 学习总结：#200\r\n> > 使用语言：go\r\n> \r\n> 因为是流式数据，所以相对而言，并不适合用一般的排序算法去做，因为数据一直在变，所以堆排序就是拿来解决这种问题的\r\n\r\n这个review真的很到位，一语点中关键点，学习了\r\n\r\n"}}
other: {"actor":{"display_login":"cc1901"}}