{"push_id":539365752,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c7edae219568c8119905abb919764c584853b5d4","before":"f553dc5918aa8262cdcc852473847b15e1e61173","commits":[{"sha":"c7edae219568c8119905abb919764c584853b5d4","author":{"email":"a6a2dc2bec09233237e468f8760a6505d111469f@gmail.com","name":"Alex Xu"},"message":"added solution with map wich reduces the time comlexity with O(n)","distinct":true,"url":"https://api.github.com/repos/tianlixu/leetcode/commits/c7edae219568c8119905abb919764c584853b5d4"}]}