{"action":"opened","issue":{"url":"https://api.github.com/repos/ninehills/ninehills.github.io/issues/50","repository_url":"https://api.github.com/repos/ninehills/ninehills.github.io","labels_url":"https://api.github.com/repos/ninehills/ninehills.github.io/issues/50/labels{/name}","comments_url":"https://api.github.com/repos/ninehills/ninehills.github.io/issues/50/comments","events_url":"https://api.github.com/repos/ninehills/ninehills.github.io/issues/50/events","html_url":"https://github.com/ninehills/ninehills.github.io/issues/50","id":248670199,"number":50,"title":"LeetCode-34. Search for a Range","user":{"login":"ninehills","id":270298,"avatar_url":"https://avatars3.githubusercontent.com/u/270298?v=4","gravatar_id":"","url":"https://api.github.com/users/ninehills","html_url":"https://github.com/ninehills","followers_url":"https://api.github.com/users/ninehills/followers","following_url":"https://api.github.com/users/ninehills/following{/other_user}","gists_url":"https://api.github.com/users/ninehills/gists{/gist_id}","starred_url":"https://api.github.com/users/ninehills/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ninehills/subscriptions","organizations_url":"https://api.github.com/users/ninehills/orgs","repos_url":"https://api.github.com/users/ninehills/repos","events_url":"https://api.github.com/users/ninehills/events{/privacy}","received_events_url":"https://api.github.com/users/ninehills/received_events","type":"User","site_admin":false},"labels":[{"id":646138254,"url":"https://api.github.com/repos/ninehills/ninehills.github.io/labels/problem","name":"problem","color":"006b75","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-08-08T10:29:12Z","updated_at":"2017-08-08T10:29:12Z","closed_at":null,"body":"问题\r\n----\r\nhttps://leetcode.com/problems/search-for-a-range/description/\r\n\r\nGiven an array of integers sorted in ascending order, find the starting and ending position of a given target value.\r\n\r\nYour algorithm's runtime complexity must be in the order of O(log n).\r\n\r\nIf the target is not found in the array, return [-1, -1].\r\n\r\nFor example,\r\nGiven [5, 7, 7, 8, 8, 10] and target value 8,\r\nreturn [3, 4].\r\n\r\n"}}
{"actor":{"display_login":"ninehills"}}