{"id":18595676,"url":"https://github.com/liupengkun1993/algorithm","last_synced_at":"2026-01-24T18:32:38.517Z","repository":{"id":143717136,"uuid":"219893581","full_name":"LiuPengKun1993/Algorithm","owner":"LiuPengKun1993","description":"LeetCode，《剑指offer》中的算法题的题目和解法以及常见算法的实现","archived":false,"fork":false,"pushed_at":"2021-01-04T06:28:37.000Z","size":75,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-16T12:39:41.283Z","etag":null,"topics":["algorithm"],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/LiuPengKun1993.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-11-06T02:20:05.000Z","updated_at":"2021-01-04T06:28:39.000Z","dependencies_parsed_at":null,"dependency_job_id":"a222f0f4-5c0e-485c-ad0b-4b2d6bfb61bf","html_url":"https://github.com/LiuPengKun1993/Algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/LiuPengKun1993/Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiuPengKun1993%2FAlgorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiuPengKun1993%2FAlgorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiuPengKun1993%2FAlgorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiuPengKun1993%2FAlgorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LiuPengKun1993","download_url":"https://codeload.github.com/LiuPengKun1993/Algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiuPengKun1993%2FAlgorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28734308,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-24T17:51:25.893Z","status":"ssl_error","status_checked_at":"2026-01-24T17:50:48.377Z","response_time":89,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm"],"created_at":"2024-11-07T01:20:42.143Z","updated_at":"2026-01-24T18:32:38.502Z","avatar_url":"https://github.com/LiuPengKun1993.png","language":null,"readme":"# Algorithm\nLeetCode，《剑指offer》中的算法题的题目和解法以及常见算法的实现\n\n# Contents\n\n| sort | title | link | level |\n|:-------:|:-------:|:-------:|:-------:|\n|1| Binary Search | [Binary Search](https://github.com/LiuPengKun1993/Algorithm/blob/master/001%20Binary%20Search.md) | easy |\n|2| 回文数 | [回文数](https://github.com/LiuPengKun1993/Algorithm/blob/master/002%20回文数.md) | easy |\n|3| 2 的幂 | [2 的幂](https://github.com/LiuPengKun1993/Algorithm/blob/master/003%202%20的幂.md) | easy |\n|4| primeNumber | [primeNumber](https://github.com/LiuPengKun1993/Algorithm/blob/master/004%20primeNumber.md) | easy |\n|5| 是否是3的幂 | [是否是3的幂](https://github.com/LiuPengKun1993/Algorithm/blob/master/005%20是否是3的幂.md) | easy |\n|6| 求众数 | [求众数](https://github.com/LiuPengKun1993/Algorithm/blob/master/006%20求众数.md) | easy |\n|7| 4的幂 | [4的幂](https://github.com/LiuPengKun1993/Algorithm/blob/master/007%204的幂.md) | easy |\n|8| 验证回文串 | [验证回文串](https://github.com/LiuPengKun1993/Algorithm/blob/master/008%20验证回文串.md) | easy |\n|9| 两数之和 | [两数之和](https://github.com/LiuPengKun1993/Algorithm/blob/master/009%20两数之和.md) | easy |\n|10| 整数翻转 | [整数翻转](https://github.com/LiuPengKun1993/Algorithm/blob/master/010%20整数翻转.md) | easy |\n|11| 只出现一次的数字 | [只出现一次的数字](https://github.com/LiuPengKun1993/Algorithm/blob/master/011%20只出现一次的数字.md) | easy |\n|12| 两数相加 | [两数相加](https://github.com/LiuPengKun1993/Algorithm/blob/master/012%20两数相加.md) | medium |\n|13| 罗马数字转整数 | [罗马数字转整数](https://github.com/LiuPengKun1993/Algorithm/blob/master/013%20罗马数字转整数.md) | easy |\n|14| 最长公共前缀 | [最长公共前缀](https://github.com/LiuPengKun1993/Algorithm/blob/master/014%20最长公共前缀.md) | easy |\n|15| 删除排序数组中的重复项 | [删除排序数组中的重复项](https://github.com/LiuPengKun1993/Algorithm/blob/master/015%20删除排序数组中的重复项.md) | easy |\n|16| 买卖股票的最佳时机 I | [买卖股票的最佳时机 I](https://github.com/LiuPengKun1993/Algorithm/blob/master/016%20买卖股票的最佳时机%20I.md) | easy |\n|17| 买卖股票的最佳时机 II | [买卖股票的最佳时机 II](https://github.com/LiuPengKun1993/Algorithm/blob/master/017%20买卖股票的最佳时机%20II.md) | easy |\n|18| 旋转数组 | [旋转数组](https://github.com/LiuPengKun1993/Algorithm/blob/master/018%20旋转数组.md) | easy |\n|19| 存在重复元素 | [存在重复元素](https://github.com/LiuPengKun1993/Algorithm/blob/master/019%20存在重复元素.md) | easy |\n|20| 两个数组的交集 II | [两个数组的交集 II](https://github.com/LiuPengKun1993/Algorithm/blob/master/020%20两个数组的交集%20II.md) | easy |\n|21| 加一 | [加一](https://github.com/LiuPengKun1993/Algorithm/blob/master/021%20加一.md) | easy |\n|22| 移动零| [移动零](https://github.com/LiuPengKun1993/Algorithm/blob/master/022%20移动零.md) | easy |\n|23| 无重复字符的最长子串 | [无重复字符的最长子串](https://github.com/LiuPengKun1993/Algorithm/blob/master/023%20无重复字符的最长子串.md) | easy |\n|24| 字符串的排列 | [字符串的排列](https://github.com/LiuPengKun1993/Algorithm/blob/master/024%20字符串的排列.md) | medium |\n|25| 字符串相乘 | [字符串相乘](https://github.com/LiuPengKun1993/Algorithm/blob/master/025%20字符串相乘.md) | medium |\n|26| 翻转字符串里的单词 | [翻转字符串里的单词](https://github.com/LiuPengKun1993/Algorithm/blob/master/026%20翻转字符串里的单词.md) | medium |\n|27| 简化路径 | [简化路径](https://github.com/LiuPengKun1993/Algorithm/blob/master/027%20简化路径.md) | medium |\n|28| 爬楼梯 | [爬楼梯](https://github.com/LiuPengKun1993/Algorithm/blob/master/028%20爬楼梯.md) | easy |\n|29| 三数之和 | [三数之和](https://github.com/LiuPengKun1993/Algorithm/blob/master/029%20三数之和.md) | medium |\n|30| 岛屿的最大面积 | [岛屿的最大面积](https://github.com/LiuPengKun1993/Algorithm/blob/master/030%20岛屿的最大面积.md) | medium |\n|31| 搜索旋转排序数组 | [搜索旋转排序数组](https://github.com/LiuPengKun1993/Algorithm/blob/master/031%20搜索旋转排序数组.md) | medium |\n|32| 最长连续递增序列 | [最长连续递增序列](https://github.com/LiuPengKun1993/Algorithm/blob/master/032%20最长连续递增序列.md) | easy |\n|33| 数组中的第K个最大元素 | [数组中的第K个最大元素](https://github.com/LiuPengKun1993/Algorithm/blob/master/033%20数组中的第K个最大元素.md) | medium |\n|34| 最长连续序列 | [最长连续序列](https://github.com/LiuPengKun1993/Algorithm/blob/master/034%20最长连续序列.md) | Hard |\n|35| 排列序列 | [排列序列](https://github.com/LiuPengKun1993/Algorithm/blob/master/035%20排列序列.md) | Hard |\n|36| 朋友圈 | [朋友圈](https://github.com/LiuPengKun1993/Algorithm/blob/master/036%20朋友圈.md) | medium |\n|37| 合并区间 | [合并区间](https://github.com/LiuPengKun1993/Algorithm/blob/master/037%20合并区间.md) | medium |\n|38| 接雨水 | [接雨水](https://github.com/LiuPengKun1993/Algorithm/blob/master/038%20接雨水.md) | Hard |\n|39| 合并两个有序链表 | [合并两个有序链表](https://github.com/LiuPengKun1993/Algorithm/blob/master/039%20合并两个有序链表.md) | easy |\n|40| 反转链表 | [反转链表](https://github.com/LiuPengKun1993/Algorithm/blob/master/040%20反转链表.md) | easy |\n|41| 最大正方形 | [最大正方形](https://github.com/LiuPengKun1993/Algorithm/blob/master/041%20最大正方形.md) | medium |\n|42| 最大子序和 | [最大子序和](https://github.com/LiuPengKun1993/Algorithm/blob/master/042%20最大子序和.md) | easy |\n|43| 三角形最小路径和 | [三角形最小路径和](https://github.com/LiuPengKun1993/Algorithm/blob/master/043%20三角形最小路径和.md) | medium |\n|44| 最小栈 | [最小栈](https://github.com/LiuPengKun1993/Algorithm/blob/master/044%20最小栈.md) | easy |\n|45| x 的平方根 | [x 的平方根](https://github.com/LiuPengKun1993/Algorithm/blob/master/045%20x%20的平方根.md) | easy |\n|46| 第二高的薪水 | [第二高的薪水](https://github.com/LiuPengKun1993/Algorithm/blob/master/046%20第二高的薪水.md) | easy |\n|47| 求众数 II | [求众数 II](https://github.com/LiuPengKun1993/Algorithm/blob/master/047%20求众数%20II.md) | easy |\n|48| 反转字符串 | [反转字符串](https://github.com/LiuPengKun1993/Algorithm/blob/master/048%20反转字符串.md) | easy |\n|49| 字符串中的第一个唯一字符 | [字符串中的第一个唯一字符](https://github.com/LiuPengKun1993/Algorithm/blob/master/049%20字符串中的第一个唯一字符.md) | easy |\n|50| 有效的字母异位词 | [有效的字母异位词](https://github.com/LiuPengKun1993/Algorithm/blob/master/050%20有效的字母异位词.md) | easy |\n|51| 二叉树的最大深度 | [二叉树的最大深度](https://github.com/LiuPengKun1993/Algorithm/blob/master/051%20二叉树的最大深度.md) | easy |\n|52| 对称二叉树 | [对称二叉树](https://github.com/LiuPengKun1993/Algorithm/blob/master/052%20对称二叉树.md) | easy |\n|53| 合并两个有序数组 | [合并两个有序数组](https://github.com/LiuPengKun1993/Algorithm/blob/master/053%20合并两个有序数组.md) | easy |\n|54| 打家劫舍 | [打家劫舍](https://github.com/LiuPengKun1993/Algorithm/blob/master/054%20打家劫舍.md) | easy |\n|55| 二叉树的所有路径 | [二叉树的所有路径](https://github.com/LiuPengKun1993/Algorithm/blob/master/055%20二叉树的所有路径.md) | easy |\n|56| 二叉树的前序遍历 | [二叉树的前序遍历](https://github.com/LiuPengKun1993/Algorithm/blob/master/056%20二叉树的前序遍历.md) | easy |\n|57| 二叉树的中序遍历 | [二叉树的中序遍历](https://github.com/LiuPengKun1993/Algorithm/blob/master/057%20二叉树的中序遍历.md) | easy |\n|58| 二叉树的后序遍历 | [二叉树的后序遍历](https://github.com/LiuPengKun1993/Algorithm/blob/master/058%20二叉树的后序遍历.md) | easy |\n|59| 路径总和 | [路径总和](https://github.com/LiuPengKun1993/Algorithm/blob/master/059%20路径总和.md) | easy |\n|60| 斐波那契数 | [斐波那契数](https://github.com/LiuPengKun1993/Algorithm/blob/master/060%20斐波那契数.md) | easy |\n\n\n\n# License\n\nThis repositorie is released under the under [MIT License](https://github.com/LiuPengKun1993/Algorithm/blob/master/LICENSE)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliupengkun1993%2Falgorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fliupengkun1993%2Falgorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliupengkun1993%2Falgorithm/lists"}