{"push_id":1351880659,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9050c6a87c7ba4cdae6061a5f37286c95d9184af","before":"86023545d746d47ad37bd7688a35e3e0c8d18e08","commits":[{"sha":"9050c6a87c7ba4cdae6061a5f37286c95d9184af","author":{"name":"robertwangcf","email":"5e5ebdb2a831c1beb35c486a444446cece0f134d@qq.com"},"message":"Create MeetRooms.java\n\nQuestion: Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference rooms required.\r\n\r\nFor example,\r\nGiven [[0, 30],[5, 10],[15, 20]],\r\nreturn 2.","distinct":true,"url":"https://api.github.com/repos/robertwangcf/Algorithms-Data-Structure/commits/9050c6a87c7ba4cdae6061a5f37286c95d9184af"}]}
{"actor":{"display_login":"robertwangcf"}}