{"push_id":1472476916,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b95f1b3fd8e5632babcba61b5ead78ae36eb166f","before":"b660f4b324e3028aad9fbda5bc8c8dd3ff4cd030","commits":[{"sha":"b95f1b3fd8e5632babcba61b5ead78ae36eb166f","author":{"name":"Jingjie Jiang","email":"cae7579791e6898167265e6aa5e1d68f3051997a@gmail.com"},"message":"236. Lowest Common Ancestor of a Binary Tree\nJJJ Dec 25, 2016\n1. idea: hash table + post-order traverse\n2. result : solved, used time 1.5 hours and run time is 32 ms, beat 9.4% in the db, fastest in the db is 9 ms\n3. things learned: 1) learn to use recursive in trees. observe the features of results(draw some trees)\n2) handle empty problem","distinct":true,"url":"https://api.github.com/repos/CHYGO1985/Algorithms_Leetcode/commits/b95f1b3fd8e5632babcba61b5ead78ae36eb166f"}]}
{"actor":{"display_login":"CHYGO1985"}}