{"action":"opened","issue":{"url":"https://api.github.com/repos/jyxiong/jyxiong.github.io/issues/23","repository_url":"https://api.github.com/repos/jyxiong/jyxiong.github.io","labels_url":"https://api.github.com/repos/jyxiong/jyxiong.github.io/issues/23/labels{/name}","comments_url":"https://api.github.com/repos/jyxiong/jyxiong.github.io/issues/23/comments","events_url":"https://api.github.com/repos/jyxiong/jyxiong.github.io/issues/23/events","html_url":"https://github.com/jyxiong/jyxiong.github.io/issues/23","id":318604200,"number":23,"title":"LeetCode 1 7 9 13 - Jingyu Xiong's Blog","user":{"login":"jyxiong","id":20831131,"avatar_url":"https://avatars2.githubusercontent.com/u/20831131?v=4","gravatar_id":"","url":"https://api.github.com/users/jyxiong","html_url":"https://github.com/jyxiong","followers_url":"https://api.github.com/users/jyxiong/followers","following_url":"https://api.github.com/users/jyxiong/following{/other_user}","gists_url":"https://api.github.com/users/jyxiong/gists{/gist_id}","starred_url":"https://api.github.com/users/jyxiong/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jyxiong/subscriptions","organizations_url":"https://api.github.com/users/jyxiong/orgs","repos_url":"https://api.github.com/users/jyxiong/repos","events_url":"https://api.github.com/users/jyxiong/events{/privacy}","received_events_url":"https://api.github.com/users/jyxiong/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-04-28T06:06:19Z","updated_at":"2018-04-28T06:06:19Z","closed_at":null,"author_association":"OWNER","body":"https://jyxiong.github.io/2018/02/23/LeetCode.html \n\n 1. 两数之和  给定一个整数数列，找出其中和为特定值的那两个数。你可以假设每个输入都只会有一种答案，同样的元素不能被重用思路遍历列表；将列表值作为 key，索引作为 value 生成 dict；直到 target - list_value 存在于 dict代码class Solution:    def two..."}}
{"actor":{"display_login":"jyxiong"}}