{"push_id":2441860978,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6f94c3914db56ac2d9ec410764cc839e9a4fa028","before":"dd12675bdf74d40e2916a0cc79c7300f39990ca2","commits":[{"sha":"6f94c3914db56ac2d9ec410764cc839e9a4fa028","author":{"name":"IcedFan","email":"9287e850a34c6095d28cd7488fcb178a92825fa3@gmail.com"},"message":"头疼，用嘻哈表存储已经求完深度的点，这点没想到不应该\n\nGiven a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.\r\n\r\nExample:\r\nGiven a binary tree \r\n          1\r\n         / \\\r\n        2   3\r\n       / \\     \r\n      4   5    \r\nReturn 3, which is the length of the path [4,2,1,3] or [5,2,1,3].\r\n\r\nNote: The length of path between two nodes is represented by the number of edges between them.","distinct":true,"url":"https://api.github.com/repos/sjtuff/answer-for-leetcode/commits/6f94c3914db56ac2d9ec410764cc839e9a4fa028"}]}
{"actor":{"display_login":"sjtuff"}}