{"repository":{"description":"给定一个长度为N的整数数组，求所有元素之和最大的一个子数组。","homepage":"","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":104,"owner":"stephatt","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2013-12-09T05:50:30-08:00","pushed_at":"2013-12-11T04:54:34-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"stephatt","company":"NUAA","email":"72529b472c3e00d9dc8a88961284bf10f5a2fafc@126.com"},"url":"https://github.com/stephatt/maxSumofSubArray/compare/078937cb0a...4197e8d372"}