{"push_id":3067657170,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8f1a3b8b9675c30e115704097c1534c9ad3a052e","before":"592be0cc0879426921816d50cc2b09b716170bb4","commits":[{"sha":"8f1a3b8b9675c30e115704097c1534c9ad3a052e","author":{"name":"wanglin0413","email":"b182ae817546ad51fb9917372fb64bf59a846055@qq.com"},"message":"https://leetcode.com/problems/longest-uncommon-subsequence-ii/\n1.只需要判断整个字符串即可，因为如果某个字符串整个是另一个字符串的字串，那么它的子串一定是其他字符串的子串。\n2.先去重，如果有重复的，排除\n3.然后安装长度排序，最长的就是result","distinct":true,"url":"https://api.github.com/repos/wanglin0413/leetcode/commits/8f1a3b8b9675c30e115704097c1534c9ad3a052e"}]}
{"actor":{"display_login":"wanglin0413"}}