{"push_id":872460492,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c9e0c2957e640e5eb046e6aaadd6232a0e2e2e0f","before":"5bdaaecebab89e861b5525d055fa98940bd07a5e","commits":[{"sha":"c9e0c2957e640e5eb046e6aaadd6232a0e2e2e0f","author":{"email":"33d0763fdae3284379652f484550f78eb5ce2603@usc.edu","name":"TLiUSC"},"message":"search in rotated sorted array, if you can not solve it once, then twice 2lgN == lgN","distinct":true,"url":"https://api.github.com/repos/TLiUSC/LintCode/commits/c9e0c2957e640e5eb046e6aaadd6232a0e2e2e0f"}]}