{"action":"opened","issue":{"url":"https://api.github.com/repos/Arcve/CLRS/issues/1","repository_url":"https://api.github.com/repos/Arcve/CLRS","labels_url":"https://api.github.com/repos/Arcve/CLRS/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/Arcve/CLRS/issues/1/comments","events_url":"https://api.github.com/repos/Arcve/CLRS/issues/1/events","html_url":"https://github.com/Arcve/CLRS/issues/1","id":309589321,"number":1,"title":"最大子数组问题","user":{"login":"Arcve","id":29119076,"avatar_url":"https://avatars0.githubusercontent.com/u/29119076?v=4","gravatar_id":"","url":"https://api.github.com/users/Arcve","html_url":"https://github.com/Arcve","followers_url":"https://api.github.com/users/Arcve/followers","following_url":"https://api.github.com/users/Arcve/following{/other_user}","gists_url":"https://api.github.com/users/Arcve/gists{/gist_id}","starred_url":"https://api.github.com/users/Arcve/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Arcve/subscriptions","organizations_url":"https://api.github.com/users/Arcve/orgs","repos_url":"https://api.github.com/users/Arcve/repos","events_url":"https://api.github.com/users/Arcve/events{/privacy}","received_events_url":"https://api.github.com/users/Arcve/received_events","type":"User","site_admin":false},"labels":[{"id":883150873,"url":"https://api.github.com/repos/Arcve/CLRS/labels/%E5%88%86%E6%B2%BB%E6%B3%95","name":"分治法","color":"bfdadc","default":false},{"id":883150994,"url":"https://api.github.com/repos/Arcve/CLRS/labels/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92","name":"动态规划","color":"bfcc4b","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-03-29T01:41:03Z","updated_at":"2018-03-29T01:41:03Z","closed_at":null,"author_association":"OWNER","body":"1.暴力破解O(n^3)，空间O(1)\r\n2.改进的暴力O(n^2),空间O(1)\r\n3.分治法O(n^2),空间O(1)\r\n4.动态规划O(n),空间O(1)"}}
{"actor":{"display_login":"Arcve"}}