{"id":17979150,"url":"https://github.com/wupeixuan/coding-interviews","last_synced_at":"2025-06-20T12:33:02.053Z","repository":{"id":105269102,"uuid":"116619882","full_name":"wupeixuan/coding-interviews","owner":"wupeixuan","description":"剑指offer","archived":false,"fork":false,"pushed_at":"2018-09-28T14:46:18.000Z","size":83,"stargazers_count":18,"open_issues_count":0,"forks_count":9,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-04-06T06:51:17.214Z","etag":null,"topics":["coding-interviews"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/wupeixuan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2018-01-08T02:37:00.000Z","updated_at":"2024-03-25T08:56:47.000Z","dependencies_parsed_at":"2023-05-22T04:15:27.278Z","dependency_job_id":null,"html_url":"https://github.com/wupeixuan/coding-interviews","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/wupeixuan/coding-interviews","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wupeixuan%2Fcoding-interviews","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wupeixuan%2Fcoding-interviews/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wupeixuan%2Fcoding-interviews/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wupeixuan%2Fcoding-interviews/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wupeixuan","download_url":"https://codeload.github.com/wupeixuan/coding-interviews/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wupeixuan%2Fcoding-interviews/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260944810,"owners_count":23086888,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["coding-interviews"],"created_at":"2024-10-29T17:36:36.775Z","updated_at":"2025-06-20T12:32:57.035Z","avatar_url":"https://github.com/wupeixuan.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 剑指Offer题目索引\n## 数组\n[数组中重复的数字](http://www.cnblogs.com/wupeixuan/p/8623363.html)\n\n[二维数组中的查找](http://www.cnblogs.com/wupeixuan/p/8623011.html)\n\n[构建乘积数组](http://www.cnblogs.com/wupeixuan/p/8623385.html)\n## 字符串\n[替换空格](http://www.cnblogs.com/wupeixuan/p/8623040.html)\n\n[字符流中第一个不重复的字符](http://www.cnblogs.com/wupeixuan/p/8623398.html)\n\n[表示数值的字符串](http://www.cnblogs.com/wupeixuan/p/8743056.html)\n## 递归和循环\n[斐波那契数列](http://www.cnblogs.com/wupeixuan/p/8623104.html)\n\n[跳台阶](http://www.cnblogs.com/wupeixuan/p/8623112.html)\n\n[变态跳台阶](http://www.cnblogs.com/wupeixuan/p/8623127.html)\n\n[矩形覆盖](http://www.cnblogs.com/wupeixuan/p/8623143.html)\n## 链表\n[从尾到头打印链表](http://www.cnblogs.com/wupeixuan/p/8623055.html)\n\n[删除链表中重复的结点](http://www.cnblogs.com/wupeixuan/p/8623420.html)\n\n[链表中环的入口结点](http://www.cnblogs.com/wupeixuan/p/8623412.html)\n## 树\n[把二叉树打印成多行](http://www.cnblogs.com/wupeixuan/p/8623459.html)\n\n[按之字形顺序打印二叉树](http://www.cnblogs.com/wupeixuan/p/8623436.html)\n\n[对称的二叉树](http://www.cnblogs.com/wupeixuan/p/8623427.html)\n\n[二叉树的下一个结点](http://www.cnblogs.com/wupeixuan/p/8678670.html)\n\n[数据流中的中位数](http://www.cnblogs.com/wupeixuan/p/8745256.html)\n\n[二叉搜索树的第k个结点](http://www.cnblogs.com/wupeixuan/p/8867010.html)\n\n[重建二叉树](http://www.cnblogs.com/wupeixuan/p/8884533.html)\n## 代码的完整性\n[数值的整数次方](http://www.cnblogs.com/wupeixuan/p/8623159.html)\n\n[调整数组顺序使奇数位于偶数前面](http://www.cnblogs.com/wupeixuan/p/8795151.html)\n## 知识迁移能力\n[二叉树的深度](http://www.cnblogs.com/wupeixuan/p/8623237.html)\n\n[平衡二叉树](http://www.cnblogs.com/wupeixuan/p/8623245.html)\n\n[左旋转字符串](http://www.cnblogs.com/wupeixuan/p/8661048.html)\n\n[数字在排序数组中出现的次数](http://www.cnblogs.com/wupeixuan/p/8679174.html)\n\n[和为S的两个数字](http://www.cnblogs.com/wupeixuan/p/8680191.html)\n\n[数组中只出现一次的数字](http://www.cnblogs.com/wupeixuan/p/8683224.html)\n\n[和为S的连续正数序列](http://www.cnblogs.com/wupeixuan/p/8687936.html)\n\n[翻转单词顺序列](https://www.cnblogs.com/wupeixuan/p/9721363.html)\n## 发散思维能力\n[不用加减乘除做加法](http://www.cnblogs.com/wupeixuan/p/8623303.html)\n\n[求1+2+3+...+n](http://www.cnblogs.com/wupeixuan/p/8623261.html)\n## 栈和队列\n[用两个栈实现队列](http://www.cnblogs.com/wupeixuan/p/8623077.html)\n\n[滑动窗口的最大值](http://www.cnblogs.com/wupeixuan/p/8881868.html)\t\n## 位运算\n[二进制中1的个数](http://www.cnblogs.com/wupeixuan/p/8623150.html)\n## 时间效率\n[连续子数组的最大和](http://www.cnblogs.com/wupeixuan/p/8623206.html)\n\n[整数中1出现的次数](http://www.cnblogs.com/wupeixuan/p/8623217.html)\n\n[数组中出现次数超过一半的数字](http://www.cnblogs.com/wupeixuan/p/8744078.html)\n\n[把数组排成最小的数](http://www.cnblogs.com/wupeixuan/p/8780642.html)\t\n## 时间空间效率的平衡\n[两个链表的第一个公共结点](http://www.cnblogs.com/wupeixuan/p/8623229.html)\n\n[第一个只出现一次的字符位置](http://www.cnblogs.com/wupeixuan/p/8878665.html)\n## 举例让抽象具体化\n[包含min函数的栈](http://www.cnblogs.com/wupeixuan/p/8623195.html)\n\n[栈的压入、弹出序列](http://www.cnblogs.com/wupeixuan/p/8682837.html)\n\n[从上往下打印二叉树](http://www.cnblogs.com/wupeixuan/p/8758540.html)\n\n[二叉树中和为某一值的路径](http://www.cnblogs.com/wupeixuan/p/8777539.html)\n\n[二叉搜索树的后序遍历序列](http://www.cnblogs.com/wupeixuan/p/8884296.html)\n## 查找和排序\n[旋转数组的最小数字](http://www.cnblogs.com/wupeixuan/p/8623095.html)\n## 综合\n[把字符串转换成整数](http://www.cnblogs.com/wupeixuan/p/8623323.html)\n## 面试思路\n[二叉树的镜像](http://www.cnblogs.com/wupeixuan/p/8623179.html)\n## 抽象建模能力\n[圆圈中最后剩下的数](http://www.cnblogs.com/wupeixuan/p/8624526.html)\n\n[扑克牌顺子](http://www.cnblogs.com/wupeixuan/p/8781081.html)\t\n## 代码的鲁棒性\n[反转链表](http://www.cnblogs.com/wupeixuan/p/8682321.html)\n\n[合并两个排序的链表](http://www.cnblogs.com/wupeixuan/p/8686438.html)\n\n[链表中倒数第k个结点](http://www.cnblogs.com/wupeixuan/p/8847132.html)\n\n[树的子结构](http://www.cnblogs.com/wupeixuan/p/8847132.html)\n## 分解让复杂问题简单\n[二叉搜索树与双向链表](http://www.cnblogs.com/wupeixuan/p/8684758.html)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwupeixuan%2Fcoding-interviews","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwupeixuan%2Fcoding-interviews","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwupeixuan%2Fcoding-interviews/lists"}