{"action":"opened","issue":{"url":"https://api.github.com/repos/algorithm004-04/algorithm004-04/issues/644","repository_url":"https://api.github.com/repos/algorithm004-04/algorithm004-04","labels_url":"https://api.github.com/repos/algorithm004-04/algorithm004-04/issues/644/labels{/name}","comments_url":"https://api.github.com/repos/algorithm004-04/algorithm004-04/issues/644/comments","events_url":"https://api.github.com/repos/algorithm004-04/algorithm004-04/issues/644/events","html_url":"https://github.com/algorithm004-04/algorithm004-04/issues/644","id":516845456,"node_id":"MDU6SXNzdWU1MTY4NDU0NTY=","number":644,"title":"【114-week 03】学习总结","user":{"login":"songjhh","id":14235245,"node_id":"MDQ6VXNlcjE0MjM1MjQ1","avatar_url":"https://avatars2.githubusercontent.com/u/14235245?v=4","gravatar_id":"","url":"https://api.github.com/users/songjhh","html_url":"https://github.com/songjhh","followers_url":"https://api.github.com/users/songjhh/followers","following_url":"https://api.github.com/users/songjhh/following{/other_user}","gists_url":"https://api.github.com/users/songjhh/gists{/gist_id}","starred_url":"https://api.github.com/users/songjhh/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/songjhh/subscriptions","organizations_url":"https://api.github.com/users/songjhh/orgs","repos_url":"https://api.github.com/users/songjhh/repos","events_url":"https://api.github.com/users/songjhh/events{/privacy}","received_events_url":"https://api.github.com/users/songjhh/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2019-11-03T15:34:17Z","updated_at":"2019-11-03T15:34:17Z","closed_at":null,"author_association":"CONTRIBUTOR","body":"# 本周总结\r\n最近太忙，总结也不是特别到位\r\n\r\n## 1. 深度优先遍历\r\n使用递归的方式，所有节点遍历且仅遍历一次。记录level层级别，一直往下探，然后递归回来。\r\n\r\n## 2. 广度优先遍历\r\n使用循环的方式，所有节点遍历且仅遍历一次。遍历完本层再进入下一层，可以用队列来实现。\r\n\r\n## 3. 贪心算法\r\n每次取局部最优解，但是不是每一次是局部最优，到最后就是最终最优解的，所以采用贪心算法，需要先证明每次局部最优最后是最终最优。所以贪心算法使用率不高\r\n\r\n## 4. 二分查找\r\n需要单调性，存在上下界并且可以下标访问\r\n\r\n## 更新下做题情况\r\n\r\n\r\n  | ToDo | In Progress | Finished\r\n-- | -- | -- | --\r\nArray | move-zeroesplus-one | 3sum | two-sumcontainer-with-most-watermove-zeroesclimbing-stairsmerge-sorted-arrayremove-duplicates-from-sorted-arrayrotate-array\r\nLinked List | reverse-linked-listswap-nodes-in-pairslinked-list-cyclelinked-list-cycle-iireverse-nodes-in-k-group |   | merge-two-sorted-lists\r\nQueue |   | design-circular-deque | sliding-window-maximum\r\nStack | trapping-rain-watervalid-parenthesesmin-stack |   | largest-rectangle-in-histogram\r\nHash |   |   | group-anagramsvalid-anagram\r\nTree | binary-tree-preorder-traversaln-ary-tree-postorder-traversaln-ary-tree-preorder-traversaln-ary-tree-level-order-traversal |   | binary-tree-inorder-traversal\r\nrecursion | climbing-stairsgenerate-parenthesesdescriptionvalidate-binary-search-treemaximum-depth-of-binary-treeminimum-depth-of-binary-treeserialize-and-deserialize-binary-treelowest-common-ancestor-of-a-binary-treeconstruct-binary-tree-from-preorder-and-inorder-traversalcombinationspermutationspermutations-ii |   |  \r\ndivision & backtracking |   |   | n-queensletter-combinations-of-a-phone-numbersubsetspowx-n\r\nBFS & DFS | minimum-genetic-mutationfind-largest-value-in-each-tree-rowword-ladderword-ladder-iiminesweeper | number-of-islands | binary-tree-level-order-traversalgenerate-parentheses\r\n\r\n\r\n"}}
{"actor":{"display_login":"songjhh"}}