{"action":"opened","issue":{"url":"https://api.github.com/repos/algorithm-study-of-GN/problem-of-coding-interview/issues/47","repository_url":"https://api.github.com/repos/algorithm-study-of-GN/problem-of-coding-interview","labels_url":"https://api.github.com/repos/algorithm-study-of-GN/problem-of-coding-interview/issues/47/labels{/name}","comments_url":"https://api.github.com/repos/algorithm-study-of-GN/problem-of-coding-interview/issues/47/comments","events_url":"https://api.github.com/repos/algorithm-study-of-GN/problem-of-coding-interview/issues/47/events","html_url":"https://github.com/algorithm-study-of-GN/problem-of-coding-interview/issues/47","id":180464733,"number":47,"title":"(#3.2) min 연산을 갖춘 스택을 구현하라.","user":{"login":"krgoodnews","id":8576087,"avatar_url":"https://avatars.githubusercontent.com/u/8576087?v=3","gravatar_id":"","url":"https://api.github.com/users/krgoodnews","html_url":"https://github.com/krgoodnews","followers_url":"https://api.github.com/users/krgoodnews/followers","following_url":"https://api.github.com/users/krgoodnews/following{/other_user}","gists_url":"https://api.github.com/users/krgoodnews/gists{/gist_id}","starred_url":"https://api.github.com/users/krgoodnews/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/krgoodnews/subscriptions","organizations_url":"https://api.github.com/users/krgoodnews/orgs","repos_url":"https://api.github.com/users/krgoodnews/repos","events_url":"https://api.github.com/users/krgoodnews/events{/privacy}","received_events_url":"https://api.github.com/users/krgoodnews/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-10-01T16:12:43Z","updated_at":"2016-10-01T16:12:43Z","closed_at":null,"body":"push와 pop의 두 가지 연산 뿐 아니라, 최솟값을 갖는 원소를 반환하는 min 연산을 갖춘 스택은 어떻게 구현할 수 있곘는가? Push, pop, min은 공히 O(1) 시간에 처리되어야 한다."}}
{"actor":{"display_login":"krgoodnews"}}