{"push_id":2525130722,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a76f6a2834ef915ede560c4f293c8b8e8b854377","before":"802a8bfb5c205c296da1c469fa1d1b0e315d2bed","commits":[{"sha":"a76f6a2834ef915ede560c4f293c8b8e8b854377","author":{"name":"LuMing","email":"eef71aabbbb6c2d034677a77ee056c3fd8e05e39@qq.com"},"message":"PAT 1037.Magic Coupon. Calculate the maxmium sum of product between two set.\nv1:use set to sort automatically, but it is too slow.\nv2:two times sort, and record the gap among neg and pos, then calculate the product.\nNotice:\nint: -21474836408 ～ +2147483647  2^30\nlong: -2147483648～2147483647\nlong long:  -9223372036854775808 ~ +9223372036854775807 2^63\nhard:★☆☆☆☆\ntime:★★★☆☆","distinct":true,"url":"https://api.github.com/repos/LuuMing/HomeWork/commits/a76f6a2834ef915ede560c4f293c8b8e8b854377"}]}
{"actor":{"display_login":"LuuMing"}}