{"push_id":3162835277,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a166468b920795e98a5b595dc3bc5490e7a13e57","before":"0ee77b14fa6f73db9c0671fc53e41b14aa0d353f","commits":[{"sha":"a166468b920795e98a5b595dc3bc5490e7a13e57","author":{"name":"sotowang","email":"e54a3525cd4e05e25ad16265f325235cf4e9cead@qq.com"},"message":"用两个栈来实现一个队列，完成队列的Push和Pop操作","distinct":true,"url":"https://api.github.com/repos/sotowang/nowcoder_test/commits/a166468b920795e98a5b595dc3bc5490e7a13e57"}]}
{"actor":{"display_login":"sotowang"}}