{"push_id":1351392229,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"199b17dba4e805b5a28d8e0d5e435cfcbba4576a","before":"cacf17bb92f1ab9bfac5717892b274e2009b303f","commits":[{"sha":"199b17dba4e805b5a28d8e0d5e435cfcbba4576a","author":{"name":"Koala5S","email":"54b3ec896bcedaa570863808fbbf3571557e52b9@gmail.com"},"message":"Set idx = m + n - 1 then merge two arrays.\n\nGiven two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.\r\nNote:\r\nYou may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.","distinct":true,"url":"https://api.github.com/repos/Koala5S/hello-world/commits/199b17dba4e805b5a28d8e0d5e435cfcbba4576a"}]}
{"actor":{"display_login":"Koala5S"}}