{"action":"opened","issue":{"url":"https://api.github.com/repos/KimDahye/2015-02-Algorithm3/issues/17","labels_url":"https://api.github.com/repos/KimDahye/2015-02-Algorithm3/issues/17/labels{/name}","comments_url":"https://api.github.com/repos/KimDahye/2015-02-Algorithm3/issues/17/comments","events_url":"https://api.github.com/repos/KimDahye/2015-02-Algorithm3/issues/17/events","html_url":"https://github.com/KimDahye/2015-02-Algorithm3/issues/17","id":109160498,"number":17,"title":"StringMatcher Finite Automata 방법에서 text의 alphabet 중복 없앤 집합으로 만들기","user":{"login":"KimDahye","id":6873655,"avatar_url":"https://avatars.githubusercontent.com/u/6873655?v=3","gravatar_id":"","url":"https://api.github.com/users/KimDahye","html_url":"https://github.com/KimDahye","followers_url":"https://api.github.com/users/KimDahye/followers","following_url":"https://api.github.com/users/KimDahye/following{/other_user}","gists_url":"https://api.github.com/users/KimDahye/gists{/gist_id}","starred_url":"https://api.github.com/users/KimDahye/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/KimDahye/subscriptions","organizations_url":"https://api.github.com/users/KimDahye/orgs","repos_url":"https://api.github.com/users/KimDahye/repos","events_url":"https://api.github.com/users/KimDahye/events{/privacy}","received_events_url":"https://api.github.com/users/KimDahye/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-09-30T19:20:13Z","updated_at":"2015-09-30T19:20:13Z","closed_at":null,"body":""}}