{"action":"opened","issue":{"url":"https://api.github.com/repos/moshiyeap/hexo_stable_comments/issues/10","repository_url":"https://api.github.com/repos/moshiyeap/hexo_stable_comments","labels_url":"https://api.github.com/repos/moshiyeap/hexo_stable_comments/issues/10/labels{/name}","comments_url":"https://api.github.com/repos/moshiyeap/hexo_stable_comments/issues/10/comments","events_url":"https://api.github.com/repos/moshiyeap/hexo_stable_comments/issues/10/events","html_url":"https://github.com/moshiyeap/hexo_stable_comments/issues/10","id":351896478,"node_id":"MDU6SXNzdWUzNTE4OTY0Nzg=","number":10,"title":"NYOJ-241字母统计+memset函数 | 日常掉头发","user":{"login":"moshiyeap","id":17582066,"node_id":"MDQ6VXNlcjE3NTgyMDY2","avatar_url":"https://avatars0.githubusercontent.com/u/17582066?v=4","gravatar_id":"","url":"https://api.github.com/users/moshiyeap","html_url":"https://github.com/moshiyeap","followers_url":"https://api.github.com/users/moshiyeap/followers","following_url":"https://api.github.com/users/moshiyeap/following{/other_user}","gists_url":"https://api.github.com/users/moshiyeap/gists{/gist_id}","starred_url":"https://api.github.com/users/moshiyeap/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/moshiyeap/subscriptions","organizations_url":"https://api.github.com/users/moshiyeap/orgs","repos_url":"https://api.github.com/users/moshiyeap/repos","events_url":"https://api.github.com/users/moshiyeap/events{/privacy}","received_events_url":"https://api.github.com/users/moshiyeap/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-08-19T11:46:44Z","updated_at":"2018-08-19T11:46:44Z","closed_at":null,"author_association":"OWNER","body":"https://liujunzhou.cn/2018/5/29/memset/#more \n\n 笔记这题不难，从思路上没什么好讲的，就是传统的笨办法，开个char数组获取字符串，另外再开个数组对每个字母出现的次数计数，然后通过ASCII-97的方式存入计数数组的对应单元，最后确定计数最大值 输出计数下标+97即可。"}}
{"actor":{"display_login":"moshiyeap"}}