cswork / lists打开题库

题号对照

剑指 Offer（第 2 版） 对照

把 剑指 Offer（第 2 版） 的 75 道题按题号对照到 CSWork：71 道可在本站在线判题，其余标为站外并链接到力扣。非官方题单，仅做题号对照。

71 / 75 道可在本站判题站外 4 道43 / 75 道有力扣主站对应题
在题库里按这份题单练习 →

第 2 章 · 基础知识（面试题 3–15）14 题 · 本站可判 14

  1. 剑指 Offer 03Find Every Reused Label原题：Find Every Reused Label（在新窗口打开）本站可判简单
  2. 剑指 Offer 04Search a 2D Matrix IILeetCode 24006 二分查找本站可判中等
  3. 剑指 Offer 05Encode Spaces as %20原题：Encode Spaces as %20（在新窗口打开）本站可判简单
  4. 剑指 Offer 06Read a Linked List Backwards原题：Read a Linked List Backwards（在新窗口打开）本站可判简单
  5. 剑指 Offer 07Construct Binary Tree from Preorder and Inorder TraversalLeetCode 10512 树的构造本站可判中等
  6. 剑指 Offer 09A Queue Out of Two Stacks原题：A Queue Out of Two Stacks（在新窗口打开）本站可判简单
  7. 剑指 Offer 10-IFibonacci Modulo a Prime原题：Fibonacci Modulo a Prime（在新窗口打开）本站可判简单
  8. 剑指 Offer 10-IIClimbing StairsLeetCode 7022 动规入门本站可判简单
  9. 剑指 Offer 11Find Minimum in Rotated Sorted Array IILeetCode 15406 二分查找本站可判困难
  10. 剑指 Offer 12Word SearchLeetCode 7921 剪枝搜索本站可判中等
  11. 剑指 Offer 13How Far the Robot Vacuum Goes原题：How Far the Robot Vacuum Goes（在新窗口打开）本站可判中等
  12. 剑指 Offer 14-IInteger BreakLeetCode 34322 动规入门本站可判中等
  13. 剑指 Offer 14-IIInteger BreakLeetCode 34322 动规入门本站可判中等
  14. 剑指 Offer 15Number of 1 BitsLeetCode 19135 位运算本站可判简单

第 3 章 · 代码的完整性与鲁棒性（16–26）10 题 · 本站可判 8

  1. 剑指 Offer 16LeetCode 50（在新窗口打开）LeetCode 50站外
  2. 剑指 Offer 17List Every Positive Number of at Most n Digits原题：List Every Positive Number of at Most n Digits（在新窗口打开）本站可判简单
  3. 剑指 Offer 18Unlink One Node原题：Unlink One Node（在新窗口打开）本站可判简单
  4. 剑指 Offer 19Regular Expression Matching（在新窗口打开）LeetCode 10站外困难
  5. 剑指 Offer 20Is This String a Number?原题：Is This String a Number?（在新窗口打开）本站可判中等
  6. 剑指 Offer 21Odd Numbers First原题：Odd Numbers First（在新窗口打开）本站可判简单
  7. 剑指 Offer 22The Last k Nodes of a List原题：The Last k Nodes of a List（在新窗口打开）本站可判简单
  8. 剑指 Offer 24Reverse Linked ListLeetCode 20609 链表本站可判简单
  9. 剑指 Offer 25Merge Two Sorted ListsLeetCode 2109 链表本站可判简单
  10. 剑指 Offer 26Does One Tree Fit Inside Another?原题：Does One Tree Fit Inside Another?（在新窗口打开）本站可判中等

第 4 章 · 画图、举例、分解（27–38）14 题 · 本站可判 13

  1. 剑指 Offer 27Invert Binary TreeLeetCode 22610 树的遍历本站可判简单
  2. 剑指 Offer 28Symmetric TreeLeetCode 10110 树的遍历本站可判简单
  3. 剑指 Offer 29LeetCode 54（在新窗口打开）LeetCode 54站外
  4. 剑指 Offer 30Min StackLeetCode 15532 迭代器设计本站可判中等
  5. 剑指 Offer 31Validate Stack SequencesLeetCode 94607 单调栈与堆本站可判中等
  6. 剑指 Offer 32-IWalk a Binary Tree Level by Level原题：Walk a Binary Tree Level by Level（在新窗口打开）本站可判中等
  7. 剑指 Offer 32-IIBinary Tree Level Order TraversalLeetCode 10210 树的遍历本站可判中等
  8. 剑指 Offer 32-IIIBinary Tree Zigzag Level Order TraversalLeetCode 10310 树的遍历本站可判中等
  9. 剑指 Offer 33Check a Search Tree's Postorder Sequence原题：Check a Search Tree's Postorder Sequence（在新窗口打开）本站可判中等
  10. 剑指 Offer 34Path Sum IILeetCode 11311 树上路径本站可判中等
  11. 剑指 Offer 35Copy List with Random PointerLeetCode 13809 链表本站可判中等
  12. 剑指 Offer 36Convert Binary Search Tree to Sorted Doubly Linked List 🔒LeetCode 42613 二叉搜索树本站可判中等
  13. 剑指 Offer 37Serialize and Deserialize Binary TreeLeetCode 29734 字典树序列化本站可判困难
  14. 剑指 Offer 38Every Arrangement of a String原题：Every Arrangement of a String（在新窗口打开）本站可判中等

第 5 章 · 时间与空间效率（39–52）14 题 · 本站可判 13

  1. 剑指 Offer 39Majority ElementLeetCode 16901 原地数组本站可判简单
  2. 剑指 Offer 40The k Smallest Numbers原题：The k Smallest Numbers（在新窗口打开）本站可判简单
  3. 剑指 Offer 41Find Median from Data StreamLeetCode 29533 缓存索引本站可判困难
  4. 剑指 Offer 42Maximum SubarrayLeetCode 5301 原地数组本站可判中等
  5. 剑指 Offer 43Number of Digit OneLeetCode 233本站可判困难
  6. 剑指 Offer 44LeetCode 400（在新窗口打开）LeetCode 400站外
  7. 剑指 Offer 45Build the Smallest Number原题：Build the Smallest Number（在新窗口打开）本站可判中等
  8. 剑指 Offer 46Ways to Read Digits as Letters原题：Ways to Read Digits as Letters（在新窗口打开）本站可判中等
  9. 剑指 Offer 47Most Coins on the Way Down原题：Most Coins on the Way Down（在新窗口打开）本站可判中等
  10. 剑指 Offer 48Longest Substring Without Repeating CharactersLeetCode 304 双指针滑窗本站可判中等
  11. 剑指 Offer 49Ugly Number IILeetCode 264本站可判中等
  12. 剑指 Offer 50The First Letter That Appears Once原题：The First Letter That Appears Once（在新窗口打开）本站可判简单
  13. 剑指 Offer 51Count Inversions原题：Count Inversions（在新窗口打开）本站可判困难
  14. 剑指 Offer 52Intersection of Two Linked ListsLeetCode 16009 链表本站可判简单

第 6 章 · 知识迁移与建模（53–66）20 题 · 本站可判 20

  1. 剑指 Offer 53-IOccurrences in a Sorted Array原题：Occurrences in a Sorted Array（在新窗口打开）本站可判简单
  2. 剑指 Offer 53-IIWhich Label Is Missing?原题：Which Label Is Missing?（在新窗口打开）本站可判简单
  3. 剑指 Offer 54The k-th Largest Value in a Search Tree原题：The k-th Largest Value in a Search Tree（在新窗口打开）本站可判简单
  4. 剑指 Offer 55-IMaximum Depth of Binary TreeLeetCode 10410 树的遍历本站可判简单
  5. 剑指 Offer 55-IIBalanced Binary TreeLeetCode 11010 树的遍历本站可判简单
  6. 剑指 Offer 56-ISingle Number IIILeetCode 26035 位运算本站可判中等
  7. 剑指 Offer 56-IISingle Number IILeetCode 13735 位运算本站可判中等
  8. 剑指 Offer 57Two Numbers That Hit the Target in a Sorted Array原题：Two Numbers That Hit the Target in a Sorted Array（在新窗口打开）本站可判简单
  9. 剑指 Offer 57-IIConsecutive Positive Integers That Sum to a Target原题：Consecutive Positive Integers That Sum to a Target（在新窗口打开）本站可判简单
  10. 剑指 Offer 58-IReverse Words in a StringLeetCode 15103 字符串本站可判中等
  11. 剑指 Offer 58-IIMove the Front of a String to the Back原题：Move the Front of a String to the Back（在新窗口打开）本站可判简单
  12. 剑指 Offer 59-ISliding Window MaximumLeetCode 23907 单调栈与堆本站可判困难
  13. 剑指 Offer 59-IIA Queue That Knows Its Maximum原题：A Queue That Knows Its Maximum（在新窗口打开）本站可判中等
  14. 剑指 Offer 60How n Dice Add Up原题：How n Dice Add Up（在新窗口打开）本站可判中等
  15. 剑指 Offer 61Can Five Cards Make a Straight?原题：Can Five Cards Make a Straight?（在新窗口打开）本站可判简单
  16. 剑指 Offer 62Who Is Left in the Circle?原题：Who Is Left in the Circle?（在新窗口打开）本站可判中等
  17. 剑指 Offer 63Best Time to Buy and Sell StockLeetCode 12129 股票买卖本站可判简单
  18. 剑指 Offer 64Add 1 Through n原题：Add 1 Through n（在新窗口打开）本站可判中等
  19. 剑指 Offer 65Sum of Two IntegersLeetCode 37135 位运算本站可判中等
  20. 剑指 Offer 66Product of Array Except SelfLeetCode 23801 原地数组本站可判中等

第 7 章 · 两个面试案例（67–68）3 题 · 本站可判 3

  1. 剑指 Offer 67String to Integer (atoi)LeetCode 803 字符串本站可判中等
  2. 剑指 Offer 68-ILowest Common Ancestor of a Binary Search TreeLeetCode 23513 二叉搜索树本站可判中等
  3. 剑指 Offer 68-IILowest Common Ancestor of a Binary TreeLeetCode 23611 树上路径本站可判中等

题单来源

剑指 Offer（第 2 版） 由其发布方整理，本页只按题号对照，不是官方页面。原题单：leetcode.cn