{"push_id":543339673,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"d7a0399f31a836e67a0c6fdce22a726ce2731c65","before":"cbb0e0aadb8dbf115c15aacad4f305a4dfa6399b","commits":[{"sha":"92559cd8113fb84c9a2c04e77dd25ba7b14c2c37","author":{"email":"562edde4ee53fdfca659e689ff2c9d89b2f67166@gmail.com","name":"HQebupt"},"message":"对于List，如果有插入删除需求，请用LinkedLis.","distinct":true,"url":"https://api.github.com/repos/HQebupt/LeetCode/commits/92559cd8113fb84c9a2c04e77dd25ba7b14c2c37"},{"sha":"d7a0399f31a836e67a0c6fdce22a726ce2731c65","author":{"email":"562edde4ee53fdfca659e689ff2c9d89b2f67166@gmail.com","name":"HQebupt"},"message":"Space: O(logn) 空间复杂度的产生是由于DFS的递归压栈而造成的.","distinct":true,"url":"https://api.github.com/repos/HQebupt/LeetCode/commits/d7a0399f31a836e67a0c6fdce22a726ce2731c65"}]}