{"push_id":630666740,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"81c6d11a28e26e336a8ea30999ace71301a67fe4","before":"407ec458915249a6828fb6e30dc73a9bea0952fc","commits":[{"sha":"81c6d11a28e26e336a8ea30999ace71301a67fe4","author":{"email":"e6aadcde585f06dcf1bdf56070478ec4283ca81e@163.com","name":"tianmn2109"},"message":"Add problem 136: Single Number\n\nGiven an array of integers, every element appears twice except for one.\nFind that single one.\n\nNote:\nYour algorithm should have a linear runtime complexity. Could you implement\nit without using extra memory?","distinct":true,"url":"https://api.github.com/repos/tianmn2109/leetcode/commits/81c6d11a28e26e336a8ea30999ace71301a67fe4"}]}