{"id":18527900,"url":"https://github.com/nemonameless/sword-for-offer","last_synced_at":"2025-05-14T21:33:19.035Z","repository":{"id":118413296,"uuid":"117255683","full_name":"nemonameless/Sword-For-Offer","owner":"nemonameless","description":"Coding Interviews 、LeetCode","archived":false,"fork":false,"pushed_at":"2018-01-13T12:15:11.000Z","size":16,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-17T06:30:25.255Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","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/nemonameless.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-12T15:15:13.000Z","updated_at":"2018-03-18T08:43:42.000Z","dependencies_parsed_at":null,"dependency_job_id":"247f0e95-90c1-4dc2-b66a-413ba71f5cab","html_url":"https://github.com/nemonameless/Sword-For-Offer","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FSword-For-Offer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FSword-For-Offer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FSword-For-Offer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemonameless%2FSword-For-Offer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nemonameless","download_url":"https://codeload.github.com/nemonameless/Sword-For-Offer/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254231380,"owners_count":22036357,"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":[],"created_at":"2024-11-06T17:56:15.894Z","updated_at":"2025-05-14T21:33:18.996Z","avatar_url":"https://github.com/nemonameless.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sword-To-Offer \nCoding Interviews--《剑指offer》第二版，原作者：https://github.com/zhedahht/CodingInterviewChinese2                \n牛客网在线编程：https://www.nowcoder.com/ta/coding-interviews \n### 数组：\n面试题3 (一)：找出数组中重复的数字        \n面试题3（二）：不修改数组找出重复的数字      \n面试题4：二维数组中的查找             \n面试题39：数组中出现次数超过一半的数字            \n面试题42：连续子数组的最大和              \n面试题45：把数组排成最小的数               \n面试题51：数组中的逆序对                      \n### 链表：\n面试题6：从尾到头打印链表                      \n面试题18（一）：在O(1)时间删除链表结点                  \n面试题18（二）：删除链表中重复的结点                    \n面试题22：链表中倒数第k个结点                \n面试题23：链表中环的入口结点              \n面试题24：反转链表           \n面试题25：合并两个排序的链表             \n面试题35：复杂链表的复制              \n面试题52：两个链表的第一个公共结点              \n### 字符串：\n面试题5：替换空格             \n面试题19：正则表达式匹配           \n面试题20：表示数值的字符串           \n面试题38：字符串的排列          \n面试题46：把数字翻译成字符串           \n面试题48：最长不含重复字符的子字符串             \n面试题50（一）：字符串中第一个只出现一次的字符          \n面试题58（一）：翻转单词顺序        \n面试题58（二）：左旋转字符串            \n### 队列和栈：\n面试题9：用两个栈实现队列            \n面试题30：包含min函数的栈            \n面试题31：栈的压入、弹出序列           \n### 二叉树：\n面试题7：重建二叉树             \n面试题8：二叉树的下一个结点            \n面试题26：树的子结构           \n面试题27：二叉树的镜像             \n面试题28：对称的二叉树           \n面试题32（一）：不分行从上往下打印二叉树            \n面试题32（二）：分行从上到下打印二叉树            \n面试题32（三）：之字形打印二叉树               \n面试题33：二叉搜索树的后序遍历序列                   \n面试题34：二叉树中和为某一值的路径                 \n面试题36：二叉搜索树与双向链表                 \n面试题37：序列化二叉树                  \n面试题54：二叉搜索树的第k个结点                 \n面试题55（一）：二叉树的深度               \n面试题55（二）：平衡二叉树                \n### 查找和排序： \n面试题11：旋转数组的最小数字               \n面试题40：最小的k个数             \n面试题41：数据流中的中位数              \n面试题43：从1到n整数中1出现的次数                \n面试题53（一）：数字在排序数组中出现的次数                 \n面试题53（二）：0到n-1中缺失的数字               \n面试题53（三）：数组中数值和下标相等的元素                  \n面试题56（一）：数组中只出现一次的两个数字                \n面试题56（二）：数组中唯一只出现一次的数字                \n### 常见简单题目： \n面试题10：斐波那契数列            \n面试题15：二进制中1的个数（代码完整性）              \n面试题16：数值的整数次方（代码完整性）                 \n面试题17：打印1到最大的n位数（代码完整性）                  \n面试题53（二）：0到n-1中缺失的数字                 \n面试题57（一）：和为s的两个数字                    \n面试题57（二）：为s的连续正数序列                 \n面试题63：股票的最大利润              \n面试题64：求1+2+…+n                       \n面试题65：不用加减乘除做加法                      \n面试题66：构建乘积数组                    \n### 较复杂题目： \n面试题21：调整数组顺序使奇数位于偶数前面            \n面试题29：顺时针打印矩阵               \n面试题49：丑数               \n面试题59（一）：滑动窗口的最大值                 \n面试题59（二）：队列的最大值              \n面试题60：n个骰子的点数                 \n面试题61：扑克牌的顺子                     \n面试题62：圆圈中最后剩下的数字                   \n### 算法-回溯法: \n面试题12：矩阵中的路径            \n面试题13：机器人的运动范围                           \n### 算法-动态规划：\n面试题14：剪绳子                   \n面试题47：礼物的最大价值                 \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemonameless%2Fsword-for-offer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnemonameless%2Fsword-for-offer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemonameless%2Fsword-for-offer/lists"}