{"push_id":1115109720,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"78d7e0ae1add2062699689fa0c38a485e91fbb38","before":"32a817a9c81d0d9014618deb4affdc6225a28dd5","commits":[{"sha":"78d7e0ae1add2062699689fa0c38a485e91fbb38","author":{"email":"547f217a5952e5f085b77d071c19370871a595d0@qq.com","name":"AhiGan"},"message":"337. House Robber III\n\nThe thief has found himself a new place for his thievery again. There is only one entrance to this area, called the \"root.\" Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that \"all houses in this place forms a binary tree\". It will automatically contact the police if two directly-linked houses were broken into on the same night.\r\n\r\nDetermine the maximum amount of money the thief can rob tonight without alerting the police.\r\n\r\nExample 1:\r\n     3\r\n    / \\\r\n   2   3\r\n    \\   \\ \r\n     3   1\r\nMaximum amount of money the thief can rob = 3 + 3 + 1 = 7.\r\nExample 2:\r\n     3\r\n    / \\\r\n   4   5\r\n  / \\   \\ \r\n 1   3   1\r\nMaximum amount of money the thief can rob = 4 + 5 = 9.","distinct":true,"url":"https://api.github.com/repos/AhiGan/LeetCode/commits/78d7e0ae1add2062699689fa0c38a485e91fbb38"}]}