{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":371060572,"defaultBranch":"main","name":"algorithm","ownerLogin":"linkypi","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-05-26T14:20:13.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/4386639?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1622039816.014666","currentOid":""},"activityList":{"items":[{"before":"c0773423c60f63e99e19e05cad35460f9d0c259a","after":"ba85a0cde788a7c49c0a67fdcc102085f1757081","ref":"refs/heads/main","pushedAt":"2024-03-04T13:32:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"增加 golang 语言实现\n1. 增加后缀数组倍增法, 倍增法实现比起DC3更简单\n2. 增加AC自动机\n3. 增加线段树实现\n4. 复习kmp，增加Z函数实现\n5. 增加树状dp案例","shortMessageHtmlLink":"增加 golang 语言实现"}},{"before":"e8a91ee2e375bec2e363bfe71cb19feab5f058b3","after":"c0773423c60f63e99e19e05cad35460f9d0c259a","ref":"refs/heads/main","pushedAt":"2024-02-17T03:09:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"go for dc3","shortMessageHtmlLink":"go for dc3"}},{"before":"705eb5df80c0aeb5f2f88adc3b590c93e11456b9","after":"e8a91ee2e375bec2e363bfe71cb19feab5f058b3","ref":"refs/heads/main","pushedAt":"2024-02-04T04:08:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"初步完成DC3算法，待leetcode验证","shortMessageHtmlLink":"初步完成DC3算法，待leetcode验证"}},{"before":"8d28a64a0f33b46e287cbd64bd8f014ef566de70","after":"705eb5df80c0aeb5f2f88adc3b590c93e11456b9","ref":"refs/heads/main","pushedAt":"2024-02-03T17:09:58.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"update DC3","shortMessageHtmlLink":"update DC3"}},{"before":"46f448d22dde7bad8796bfbc3875ad3411287d95","after":"8d28a64a0f33b46e287cbd64bd8f014ef566de70","ref":"refs/heads/main","pushedAt":"2024-01-30T10:26:34.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"add some case for golang","shortMessageHtmlLink":"add some case for golang"}},{"before":"514e069dd84cb1e48e5c8c6c47e1ab100fc8cb97","after":"46f448d22dde7bad8796bfbc3875ad3411287d95","ref":"refs/heads/main","pushedAt":"2024-01-27T14:00:50.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"Merge remote-tracking branch 'origin/main'","shortMessageHtmlLink":"Merge remote-tracking branch 'origin/main'"}},{"before":"df7b14fbf1f046ffb2a8a181cfc17d8953887d09","after":"514e069dd84cb1e48e5c8c6c47e1ab100fc8cb97","ref":"refs/heads/main","pushedAt":"2024-01-27T13:52:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"add golang","shortMessageHtmlLink":"add golang"}},{"before":"718c01eb9c7ccaea4c4c60528c5fd86ac63572d6","after":"df7b14fbf1f046ffb2a8a181cfc17d8953887d09","ref":"refs/heads/main","pushedAt":"2023-12-18T12:25:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"补充案例","shortMessageHtmlLink":"补充案例"}},{"before":"d658b4bafb6bf5eba50a7adf42de34421c5de75d","after":"718c01eb9c7ccaea4c4c60528c5fd86ac63572d6","ref":"refs/heads/main","pushedAt":"2023-12-15T02:03:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"增加正则匹配算法案例","shortMessageHtmlLink":"增加正则匹配算法案例"}},{"before":"d1f32c857a0949577ee69d201195a019671015b1","after":"d658b4bafb6bf5eba50a7adf42de34421c5de75d","ref":"refs/heads/main","pushedAt":"2023-10-26T02:03:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"增加正则匹配算法， 待完善","shortMessageHtmlLink":"增加正则匹配算法， 待完善"}},{"before":"1d68f505a34319169c08d1983b2ce3cdee93dd98","after":"d1f32c857a0949577ee69d201195a019671015b1","ref":"refs/heads/main","pushedAt":"2023-10-25T07:18:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"1. 增加随机算法 及 水塘抽样算法\n2. 增加下一个排列\n3. 增加矩阵最长递增路径","shortMessageHtmlLink":"1. 增加随机算法 及 水塘抽样算法"}},{"before":"7c35b43632ae276544ce8f169620136ace058ba5","after":"1d68f505a34319169c08d1983b2ce3cdee93dd98","ref":"refs/heads/main","pushedAt":"2023-10-22T14:19:03.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"Merge branch 'main' of https://github.com/linkypi/algorithm\n\n# Conflicts:\n#\tsrc/main/java/com/lynch/string/KMP.java","shortMessageHtmlLink":"Merge branch 'main' of <a href=\"https://github.com/linkypi/algorithm\">https://github.com/linkypi/algorithm</a>"}},{"before":"b8b80ccada72500328280455f49a74a62b69a956","after":"7c35b43632ae276544ce8f169620136ace058ba5","ref":"refs/heads/main","pushedAt":"2023-10-22T14:06:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"增加求阶乘结果末尾 0 个数相关算法案例","shortMessageHtmlLink":"增加求阶乘结果末尾 0 个数相关算法案例"}},{"before":"ca653c39e03ca51e07d885edc8b90b1b66e2d952","after":"b8b80ccada72500328280455f49a74a62b69a956","ref":"refs/heads/main","pushedAt":"2023-10-20T13:18:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"增加部分随机算法实现","shortMessageHtmlLink":"增加部分随机算法实现"}},{"before":"72a226989b88125f1bc3cb46dafe7f9551699e28","after":"ca653c39e03ca51e07d885edc8b90b1b66e2d952","ref":"refs/heads/main","pushedAt":"2023-10-12T03:32:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"增加 TrieMap 实现","shortMessageHtmlLink":"增加 TrieMap 实现"}},{"before":"ad5b92fa62cda8f458ea9534ec6a32a25e7088a0","after":"72a226989b88125f1bc3cb46dafe7f9551699e28","ref":"refs/heads/main","pushedAt":"2023-08-28T10:31:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"add2d7ee5f9939b8277cd2e3350fbb8d6ebb1adf","after":"ad5b92fa62cda8f458ea9534ec6a32a25e7088a0","ref":"refs/heads/main","pushedAt":"2023-08-24T10:08:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"1. 完善排序 及 子集算法\n2. 增加 dp 案例：求连续数组最大值，元素包含负数","shortMessageHtmlLink":"1. 完善排序 及 子集算法"}},{"before":"68e391bc46bbc68cbb8811b47faa2ca353c222e4","after":"add2d7ee5f9939b8277cd2e3350fbb8d6ebb1adf","ref":"refs/heads/main","pushedAt":"2023-08-18T09:12:00.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"1. KMP 实现\n2. 使用回溯算法实现集合所有子集，集合全排列及组合\n3. 求数据流中位数\n4. 求左右移动可以达到指定目标的最少移动次数\n5. 求二叉树指定路径和\n6. 求区间内所有数字 按位与 的结果","shortMessageHtmlLink":"1. KMP 实现"}},{"before":"40700967f7fa048531da61573b12b6869e1392c7","after":"68e391bc46bbc68cbb8811b47faa2ca353c222e4","ref":"refs/heads/main","pushedAt":"2023-08-11T10:58:07.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"1. 树状数组\n2. 增加dp案例\n3. 增加等概率求解案例\n4. 复习 RabinKarp","shortMessageHtmlLink":"1. 树状数组"}},{"before":"946cd573c15b80339a8f26987ce14ba30b703fbc","after":"40700967f7fa048531da61573b12b6869e1392c7","ref":"refs/heads/main","pushedAt":"2023-08-04T09:41:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"1. 增加求两个正序数组中位数案例\n2. 求一个数组变为另一数组子序列的最少操作次数\n3. 给你一个未排序的整数数组 nums ，请你找出其中没有出现的最小的正整数\n4. 找出最长有效（格式正确且连续）括号子串的长度","shortMessageHtmlLink":"1. 增加求两个正序数组中位数案例"}},{"before":"d924f3ed3e06a449e983392c29b19fdbcf6baf1c","after":"946cd573c15b80339a8f26987ce14ba30b703fbc","ref":"refs/heads/main","pushedAt":"2023-07-27T09:48:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"1. 补充 DP 案例\n2. 增加最小生成树算法\n3. 对比Prim与 Dijkstra算法","shortMessageHtmlLink":"1. 补充 DP 案例"}},{"before":"4a0786f0d5959dabb092f74b37256826ec333a4d","after":"d924f3ed3e06a449e983392c29b19fdbcf6baf1c","ref":"refs/heads/main","pushedAt":"2023-07-25T06:15:10.000Z","pushType":"push","commitsCount":8,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"Merge remote-tracking branch 'origin/main' into main\n\n# Conflicts:\n#\tsrc/main/java/com/lynch/dp/MaxValueEvent.java","shortMessageHtmlLink":"Merge remote-tracking branch 'origin/main' into main"}},{"before":"8e8b69f4fe7738ed479618ab14ac2ccdf8f73e6f","after":"4a0786f0d5959dabb092f74b37256826ec333a4d","ref":"refs/heads/main","pushedAt":"2023-07-24T14:06:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"Create README.md","shortMessageHtmlLink":"Create README.md"}},{"before":"09597860817dec1de672c5e23ce96c5c50d9f4d5","after":"8e8b69f4fe7738ed479618ab14ac2ccdf8f73e6f","ref":"refs/heads/main","pushedAt":"2023-06-11T13:04:21.842Z","pushType":"push","commitsCount":4,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"Merge remote-tracking branch 'origin/main'\n\n# Conflicts:\n#\tsrc/com/lynch/extern/MaxSumInArr.java\n#\tsrc/main/java/com/lynch/LongestIncSubSeq.java\n#\tsrc/main/java/com/lynch/MaxEvents.java\n#\tsrc/main/java/com/lynch/MaxSubForBT.java\n#\tsrc/main/java/com/lynch/MaxValueForEvents.java\n#\tsrc/main/java/com/lynch/MediumOfTwoIncArr.java\n#\tsrc/main/java/com/lynch/dp/BTMaxDistant.java\n#\tsrc/main/java/com/lynch/dp/CoinValueMulti.java\n#\tsrc/main/java/com/lynch/extern/Manacher.java\n#\tsrc/main/java/com/lynch/extern/MaxLengthSumKInArr.java\n#\tsrc/main/java/com/lynch/extern/MaxWindow.java\n#\tsrc/main/java/com/lynch/extern/MostXor.java\n#\tsrc/main/java/com/lynch/extern/NQueues.java\n#\tsrc/main/java/com/lynch/extern/RecentlyMin.java\n#\tsrc/main/java/com/lynch/fibo_extern/Cow.java\n#\tsrc/main/java/com/lynch/fibo_extern/FindMatchStr.java","shortMessageHtmlLink":"Merge remote-tracking branch 'origin/main'"}},{"before":"4197a3c3f199022e85f87714204072e4f394da68","after":"09597860817dec1de672c5e23ce96c5c50d9f4d5","ref":"refs/heads/main","pushedAt":"2023-06-10T15:14:57.483Z","pushType":"push","commitsCount":1,"pusher":{"login":"linkypi","name":"LinkyPi","path":"/linkypi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/4386639?s=80&v=4"},"commit":{"message":"1. 增加背包问题，实现01背包，完全背包及多维背包问题待完善\n2. 增加获取指定权重比例随机数\n3. 增加参加会议的最大价值","shortMessageHtmlLink":"1. 增加背包问题，实现01背包，完全背包及多维背包问题待完善"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wMy0wNFQxMzozMjoyNi4wMDAwMDBazwAAAAQLxb1O","endCursor":"Y3Vyc29yOnYyOpK7MjAyMy0wNi0xMFQxNToxNDo1Ny40ODM5NzlazwAAAAM-wrGl"}},"title":"Activity · linkypi/algorithm"}