{"push_id":1314861642,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b5979d5fbfdc717300a81995726581b178625131","before":"a5a11e59dc5aea3cb4197eb525c088246cdbb5af","commits":[{"sha":"b5979d5fbfdc717300a81995726581b178625131","author":{"name":"fp-zhandongpan","email":"67806af219507cefd5806d8dad2ced955ee63744"},"message":"Find out the tow numbers from a monotonous incremental array of int, whose sum is k. Demands the complexity must be O(n)","distinct":true,"url":"https://api.github.com/repos/dustinfog/algorithms/commits/b5979d5fbfdc717300a81995726581b178625131"}]}
{"actor":{"display_login":"dustinfog"}}