{"action":"created","issue":{"url":"https://api.github.com/repos/githubwoniu/learnprogram/issues/56","repository_url":"https://api.github.com/repos/githubwoniu/learnprogram","labels_url":"https://api.github.com/repos/githubwoniu/learnprogram/issues/56/labels{/name}","comments_url":"https://api.github.com/repos/githubwoniu/learnprogram/issues/56/comments","events_url":"https://api.github.com/repos/githubwoniu/learnprogram/issues/56/events","html_url":"https://github.com/githubwoniu/learnprogram/pull/56","id":198728444,"number":56,"title":"Upload my Code 003","user":{"login":"JosanSun","id":24600091,"avatar_url":"https://avatars.githubusercontent.com/u/24600091?v=3","gravatar_id":"","url":"https://api.github.com/users/JosanSun","html_url":"https://github.com/JosanSun","followers_url":"https://api.github.com/users/JosanSun/followers","following_url":"https://api.github.com/users/JosanSun/following{/other_user}","gists_url":"https://api.github.com/users/JosanSun/gists{/gist_id}","starred_url":"https://api.github.com/users/JosanSun/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/JosanSun/subscriptions","organizations_url":"https://api.github.com/users/JosanSun/orgs","repos_url":"https://api.github.com/users/JosanSun/repos","events_url":"https://api.github.com/users/JosanSun/events{/privacy}","received_events_url":"https://api.github.com/users/JosanSun/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2017-01-04T15:05:27Z","updated_at":"2017-01-05T02:56:27Z","closed_at":null,"pull_request":{"url":"https://api.github.com/repos/githubwoniu/learnprogram/pulls/56","html_url":"https://github.com/githubwoniu/learnprogram/pull/56","diff_url":"https://github.com/githubwoniu/learnprogram/pull/56.diff","patch_url":"https://github.com/githubwoniu/learnprogram/pull/56.patch"},"body":"this is my code, please check"},"comment":{"url":"https://api.github.com/repos/githubwoniu/learnprogram/issues/comments/270551209","html_url":"https://github.com/githubwoniu/learnprogram/pull/56#issuecomment-270551209","issue_url":"https://api.github.com/repos/githubwoniu/learnprogram/issues/56","id":270551209,"user":{"login":"bajdcc","id":4200516,"avatar_url":"https://avatars.githubusercontent.com/u/4200516?v=3","gravatar_id":"","url":"https://api.github.com/users/bajdcc","html_url":"https://github.com/bajdcc","followers_url":"https://api.github.com/users/bajdcc/followers","following_url":"https://api.github.com/users/bajdcc/following{/other_user}","gists_url":"https://api.github.com/users/bajdcc/gists{/gist_id}","starred_url":"https://api.github.com/users/bajdcc/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/bajdcc/subscriptions","organizations_url":"https://api.github.com/users/bajdcc/orgs","repos_url":"https://api.github.com/users/bajdcc/repos","events_url":"https://api.github.com/users/bajdcc/events{/privacy}","received_events_url":"https://api.github.com/users/bajdcc/received_events","type":"User","site_admin":false},"created_at":"2017-01-05T02:56:27Z","updated_at":"2017-01-05T02:56:27Z","body":"dp的思路很好，不过好像并不能降低复杂度。。假如我从每个下标处向右做哈希查找，最后求个最大值，复杂度也是n2，这是最简单的方法。\ndp的缺陷在于分解子问题时，子问题的解法重复了。比如abcdefgh，那么每次for循环，j都会从i开始递减至0，那么每个串都被查找了一次。常规说法从左开始找，结果是串的长度，那么就**不需要再找**，直接可以结束了。因此dp方法有待优化。\nhint：如果串中有连续字符，是不是可以当作间断点？那么能不能分治？\n其他的，getmax建议用宏语句。init函数严格意义上应用memset等基本函数，在汇编层面采用串重复指令。"}}
{"actor":{"display_login":"bajdcc"}}