{"push_id":2338640855,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4cf6d4770a5885cce78ae6af98b23de13aa2bc5c","before":"1496c3b5f1c29316568b395d9fc31b4d6813238a","commits":[{"sha":"4cf6d4770a5885cce78ae6af98b23de13aa2bc5c","author":{"name":"Doanh","email":"7c469255d2ea6c6cef47954b310e3e987066caa0@gmail.com"},"message":"The longest increasing subsequence\n\nGiven an unsorted array of integers, find the length of longest increasing subsequence.\r\n\r\nFor example,\r\nGiven [10, 9, 2, 5, 3, 7, 101, 18],\r\nThe longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that there may be more than one LIS combination, it is only necessary for you to return the length.\r\n\r\nYour algorithm should run in O(n2) complexity.","distinct":true,"url":"https://api.github.com/repos/tochiton/CodeForFun/commits/4cf6d4770a5885cce78ae6af98b23de13aa2bc5c"}]}
{"actor":{"display_login":"tochiton"}}