{"push_id":641741618,"size":16,"distinct_size":16,"ref":"refs/heads/master","head":"bc697a55c7da07177b452da9f68964bede10a4a4","before":"ff8f3f10c250ee791d69791b06da61d3f953908f","commits":[{"sha":"e067e5888ff3eb653b7031035f5479ef6f87ffdf","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Binary_Tree_Preorder_Traversal","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/e067e5888ff3eb653b7031035f5479ef6f87ffdf"},{"sha":"13fb1e53a3f8d15c39c745879a3ae3826e7dab6e","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Binary_Tree_Inorder_Traversal","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/13fb1e53a3f8d15c39c745879a3ae3826e7dab6e"},{"sha":"18005fe4977eb40e3362b5cb1c298cde17e224e9","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Populating_Next_Right_Pointers_in_Each_Node","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/18005fe4977eb40e3362b5cb1c298cde17e224e9"},{"sha":"4719e9405924fe388ba2a92052fa9c5210ab0ab9","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Search_Insert_Position","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/4719e9405924fe388ba2a92052fa9c5210ab0ab9"},{"sha":"152037846f22c3f7883bfc40d7d251b0c2778595","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve N_Queens_II","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/152037846f22c3f7883bfc40d7d251b0c2778595"},{"sha":"bf675d32042842c3c3ccc86904d5cd11553ff4fb","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Single_Number_II","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/bf675d32042842c3c3ccc86904d5cd11553ff4fb"},{"sha":"f87c6bf21a42b85309ad0f91ab50b7cbabacdda8","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"Maximum_Subarray","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/f87c6bf21a42b85309ad0f91ab50b7cbabacdda8"},{"sha":"fe61f111f8a704943ec87fc7efea70928da91fea","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Majority_Element","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/fe61f111f8a704943ec87fc7efea70928da91fea"},{"sha":"c384687dede1d252c70255c5498f8de75b4bf5ec","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Happy_Number","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/c384687dede1d252c70255c5498f8de75b4bf5ec"},{"sha":"cf79ecb86c34f1e9c24b1fde60d6d25d3461c57f","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Binary_Tree_Upside_Down","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/cf79ecb86c34f1e9c24b1fde60d6d25d3461c57f"},{"sha":"2a19121b766ec0f5a761dacaebf235d8bc97f82e","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Delete_Duplicates","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/2a19121b766ec0f5a761dacaebf235d8bc97f82e"},{"sha":"229c387a9bc78d0adada2f1fef65e0caf29e26bb","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Climbing_Stairs","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/229c387a9bc78d0adada2f1fef65e0caf29e26bb"},{"sha":"35bccf3c301ea22f6e8255945b2a59ecd7bcfcb5","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Convert_Sorted_Array_to_Binary_Search_Tree","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/35bccf3c301ea22f6e8255945b2a59ecd7bcfcb5"},{"sha":"93776019217bc14d614aad6338e7860418032295","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Unique_Paths","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/93776019217bc14d614aad6338e7860418032295"},{"sha":"941f573e0a603594cdf793359c06d9f99eb857bb","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Find_Minimum_in_Rotated_Sorted_Array","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/941f573e0a603594cdf793359c06d9f99eb857bb"},{"sha":"bc697a55c7da07177b452da9f68964bede10a4a4","author":{"email":"9b0a4c88ce516b609d00a285da575a4da63aa6c8@gree.net","name":"sixing.wen"},"message":"solve Sort_Colors","distinct":true,"url":"https://api.github.com/repos/wensixing/LeetCodeCpp/commits/bc697a55c7da07177b452da9f68964bede10a4a4"}]}