{"action":"opened","issue":{"url":"https://api.github.com/repos/zhchch/interview-dfq/issues/6","repository_url":"https://api.github.com/repos/zhchch/interview-dfq","labels_url":"https://api.github.com/repos/zhchch/interview-dfq/issues/6/labels{/name}","comments_url":"https://api.github.com/repos/zhchch/interview-dfq/issues/6/comments","events_url":"https://api.github.com/repos/zhchch/interview-dfq/issues/6/events","html_url":"https://github.com/zhchch/interview-dfq/issues/6","id":345591771,"node_id":"MDU6SXNzdWUzNDU1OTE3NzE=","number":6,"title":"从时间复杂度、空间复杂度的角度上解释以下代码存在的问题","user":{"login":"cryeer","id":22783067,"node_id":"MDQ6VXNlcjIyNzgzMDY3","avatar_url":"https://avatars1.githubusercontent.com/u/22783067?v=4","gravatar_id":"","url":"https://api.github.com/users/cryeer","html_url":"https://github.com/cryeer","followers_url":"https://api.github.com/users/cryeer/followers","following_url":"https://api.github.com/users/cryeer/following{/other_user}","gists_url":"https://api.github.com/users/cryeer/gists{/gist_id}","starred_url":"https://api.github.com/users/cryeer/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cryeer/subscriptions","organizations_url":"https://api.github.com/users/cryeer/orgs","repos_url":"https://api.github.com/users/cryeer/repos","events_url":"https://api.github.com/users/cryeer/events{/privacy}","received_events_url":"https://api.github.com/users/cryeer/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-07-30T02:39:03Z","updated_at":"2018-07-30T02:39:03Z","closed_at":null,"author_association":"NONE","body":"https://github.com/zhchch/interview-dfq/blob/38c74bf2b150239643de2e5bcc6eb198d1e69443/async-example/demandFive/quicksort.ts#L1-L17"}}
{"actor":{"display_login":"cryeer"}}