{"push_id":725916637,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"38b1649a45bd1ecb90d57c7ccec557a3afd21b20","before":"1215cb12e2296273fd3732828e5aca579bd86d83","commits":[{"sha":"38b1649a45bd1ecb90d57c7ccec557a3afd21b20","author":{"email":"4137a24d79f81dfb2c4631c4bddbe079e0751506@hotmail.com","name":"zhiyanglu"},"message":"Number of Digit One\n\nGiven an integer n, count the total number of digit 1 appearing in all\nnon-negative integers less than or equal to n.","distinct":true,"url":"https://api.github.com/repos/zhiyanglu/LeetCode-Java/commits/38b1649a45bd1ecb90d57c7ccec557a3afd21b20"}]}