{"push_id":781260286,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"f03245ef59423a954b6c10327c418e7a4bb611de","before":"64cd85d38e630fa3655d1ee062b69746a290de2c","commits":[{"sha":"b12e8e370e64a97a7bb2c5c477f1c53af1160ab0","author":{"email":"1b1a237a9d03afa8ed3207faae8f845177fe5158@gmail.com","name":"tangwz"},"message":"整数中1出现的次数（从1到n整数中1出现的次数）","distinct":true,"url":"https://api.github.com/repos/tangwz/leetcode/commits/b12e8e370e64a97a7bb2c5c477f1c53af1160ab0"},{"sha":"f3931feb4764da4829c356aea77e3b2bed1d2ac9","author":{"email":"1b1a237a9d03afa8ed3207faae8f845177fe5158@gmail.com","name":"tangwz"},"message":"把数组排成最小的数","distinct":true,"url":"https://api.github.com/repos/tangwz/leetcode/commits/f3931feb4764da4829c356aea77e3b2bed1d2ac9"},{"sha":"f03245ef59423a954b6c10327c418e7a4bb611de","author":{"email":"1b1a237a9d03afa8ed3207faae8f845177fe5158@gmail.com","name":"tangwz"},"message":"丑数","distinct":true,"url":"https://api.github.com/repos/tangwz/leetcode/commits/f03245ef59423a954b6c10327c418e7a4bb611de"}]}