{"push_id":1213988052,"size":9,"distinct_size":9,"ref":"refs/heads/master","head":"59fe9a9f369e6064bba0aab8c7e45afa50885683","before":"6d61d0812c6bac62c0da53c27bf1103a5fe69004","commits":[{"sha":"01a78013e6d34f167b557a05ccfda71909ab7c9a","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"302: Smallest Rectangle Enclosing Black Pixels","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/01a78013e6d34f167b557a05ccfda71909ab7c9a"},{"sha":"88ba605523047ee776d2f0c4056a80634444bf49","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"287: Find the duplicate number (two versions)","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/88ba605523047ee776d2f0c4056a80634444bf49"},{"sha":"9de0959c01fb29ff031556b7153b1efb73e19968","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"1: two sum","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/9de0959c01fb29ff031556b7153b1efb73e19968"},{"sha":"3fd3fc981cd53f5eab771a98ac0d098c1a31dff3","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"15: three sum","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/3fd3fc981cd53f5eab771a98ac0d098c1a31dff3"},{"sha":"88dbf864f1bec16edaf7337d558edc12367d6a52","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"17: aletter combination of phone number. added a more efficient method","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/88dbf864f1bec16edaf7337d558edc12367d6a52"},{"sha":"1dfb3e3cdc54a5b5ad82616c8c64ad78a6284832","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"25: Reverse Nodes in K Groups","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/1dfb3e3cdc54a5b5ad82616c8c64ad78a6284832"},{"sha":"c913750ecb125e587d72e9d597e33533cf93eaa2","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"fix bug","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/c913750ecb125e587d72e9d597e33533cf93eaa2"},{"sha":"db34a71712f40a0433d0e0742fa7a8b050e2fc45","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"fixed bugs. added comments","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/db34a71712f40a0433d0e0742fa7a8b050e2fc45"},{"sha":"59fe9a9f369e6064bba0aab8c7e45afa50885683","author":{"name":"Shawn Song","email":"509f45406739745029eb6511213bdabdc42d3ab7@gmail.com"},"message":"Merge remote-tracking branch 'origin/master'\n\nConflicts:\n\tLeetCode/src/leetcode/Q287_FindTheDuplicateNumber.java","distinct":true,"url":"https://api.github.com/repos/shawnsong/LeetCode/commits/59fe9a9f369e6064bba0aab8c7e45afa50885683"}]}
{"actor":{"display_login":"shawnsong"}}