{"push_id":1269178529,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"3cde8bd3f61eedd3b8cf22c4cfa0fff8b7553eb5","before":"f08b61cb5f5d2d3e0f911622ec75fb99a3b2964c","commits":[{"sha":"e1bb2f6eea28bee6ccd8b5b284eb6e6d101f6b55","author":{"name":"FreemanZhang","email":"96c988f71b9f96c8f4242819c78e2ff34ba1a0fc@opentext.com"},"message":"delete impl in bfs and simplified dp impl\n\n1. must add comments to code. Otherwise will not be able to recognize\n2. even the code implemented three days ago are different from the code\nimplemented today!!!","distinct":true,"url":"https://api.github.com/repos/FreemanZhang/leetcode/commits/e1bb2f6eea28bee6ccd8b5b284eb6e6d101f6b55"},{"sha":"3cde8bd3f61eedd3b8cf22c4cfa0fff8b7553eb5","author":{"name":"FreemanZhang","email":"96c988f71b9f96c8f4242819c78e2ff34ba1a0fc@opentext.com"},"message":"fix NPE bugs and summarize clean code principles:\n\n1. Map data structure has two functionalities: one is to store cloned\nnodes, the other is to use as visited set for dfs to avoid infinite loop\n2. Put if comment inside if block, otherwise confusing\n3. fix NPE bugs\n4. Reuse the return value of cloneGraphRecurse node\n5. Naming","distinct":true,"url":"https://api.github.com/repos/FreemanZhang/leetcode/commits/3cde8bd3f61eedd3b8cf22c4cfa0fff8b7553eb5"}]}
{"actor":{"display_login":"FreemanZhang"}}