{"push_id":1032361500,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ff6fd87ea05914a165c4e2701e260294aaed2bb9","before":"105b4d3d5e16c8da942e84f4b5d448a4f5e776e4","commits":[{"sha":"ff6fd87ea05914a165c4e2701e260294aaed2bb9","author":{"email":"edde69039883845c0d320ab5f5a0597c491b9b26@users.noreply.github.com","name":"Ye Hu"},"message":"Create Two Sum\n\nGiven an array of integers, find two numbers such that they add up to a specific target number.\r\n\r\nThe function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are NOT zero-based.","distinct":true,"url":"https://api.github.com/repos/sophiehu2509/Lintcode/commits/ff6fd87ea05914a165c4e2701e260294aaed2bb9"}]}