{"push_id":1918878174,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c4a435be631a4ddc6bea17fe3be930e84cd4c872","before":"83060bf42573d65cc3e69d048eb5b1019456377b","commits":[{"sha":"c4a435be631a4ddc6bea17fe3be930e84cd4c872","author":{"name":"lhclhc1109","email":"55cb3f7d11f5d9188f241b36d2f2c424ba085c5d@users.noreply.github.com"},"message":"Two Sum\n\nGiven an array of integers, return indices of the two numbers such that they add up to a specific target.\r\nYou may assume that each input would have exactly one solution, and you may not use the same element twice.\r\nExample:\r\nGiven nums = [2, 7, 11, 15], target = 9,\r\nBecause nums[0] + nums[1] = 2 + 7 = 9,\r\nreturn [0, 1].","distinct":true,"url":"https://api.github.com/repos/lhclhc1109/leetcode/commits/c4a435be631a4ddc6bea17fe3be930e84cd4c872"}]}
{"actor":{"display_login":"lhclhc1109"}}