# 剑指 Offer Java 题解
> 来源:[《剑指 Offer》 Java 版实现](https://github.com/doocs/coding-interview)
| # | Title |
|---|---|
| 03_01 | [Find Duplication In Array](/docs/剑指offer/Java/03_01_DuplicationInArray) |
| 03_02 | [Find Duplication In Array II](/docs/剑指offer/Java/03_02_DuplicationInArrayNoEdit) |
| 04 | [Find In Partially Sorted Matrix](/docs/剑指offer/Java/04_FindInPartiallySortedMatrix) |
| 05 | [Replace Spaces](/docs/剑指offer/Java/05_ReplaceSpaces) |
| 06 | [Print List In Reversed Order](/docs/剑指offer/Java/06_PrintListInReversedOrder) |
| 07 | [Construct Binary Tree](/docs/剑指offer/Java/07_ConstructBinaryTree) |
| 08 | [Next Node In Binary Trees](/docs/剑指offer/Java/08_NextNodeInBinaryTrees) |
| 09_01 | [Queue With Two Stacks](/docs/剑指offer/Java/09_01_QueueWithTwoStacks) |
| 09_02 | [Stack With Two Queues](/docs/剑指offer/Java/09_02_StackWithTwoQueues) |
| 10_01 | [Fibonacci](/docs/剑指offer/Java/10_01_Fibonacci) |
| 10_02 | [Jump Floor](/docs/剑指offer/Java/10_02_JumpFloor) |
| 10_03 | [Jump Floor II](/docs/剑指offer/Java/10_03_JumpFloorII) |
| 10_04 | [Rect Cover](/docs/剑指offer/Java/10_04_RectCover) |
| 11 | [Min Number In Rotated Array](/docs/剑指offer/Java/11_MinNumberInRotatedArray) |
| 12 | [String Path In Matrix](/docs/剑指offer/Java/12_StringPathInMatrix) |
| 13 | [Robot Move](/docs/剑指offer/Java/13_RobotMove) |
| 14 | [Cutting Rope](/docs/剑指offer/Java/14_CuttingRope) |
| 15 | [Number Of 1 In Binary](/docs/剑指offer/Java/15_NumberOf1InBinary) |
| 16 | [Power](/docs/剑指offer/Java/16_Power) |
| 17 | [Print 1 To Max Of N Digits](/docs/剑指offer/Java/17_Print1ToMaxOfNDigits) |
| 18_01 | [Delete Node In List](/docs/剑指offer/Java/18_01_DeleteNodeInList) |
| 18_02 | [Delete Duplicated Node](/docs/剑指offer/Java/18_02_DeleteDuplicatedNode) |
| 19 | [Regular Expressions Matching](/docs/剑指offer/Java/19_RegularExpressionsMatching) |
| 20 | [Numeric Strings](/docs/剑指offer/Java/20_NumericStrings) |
| 21 | [Reorder Array](/docs/剑指offer/Java/21_ReorderArray) |
| 22 | [Kth Node From End](/docs/剑指offer/Java/22_KthNodeFromEnd) |
| 23 | [Entry Node In List Loop](/docs/剑指offer/Java/23_EntryNodeInListLoop) |
| 24 | [Reverse List](/docs/剑指offer/Java/24_ReverseList) |
| 25 | [Merge Sorted Lists](/docs/剑指offer/Java/25_MergeSortedLists) |
| 26 | [Substructure In Tree](/docs/剑指offer/Java/26_SubstructureInTree) |
| 27 | [Mirror Of Binary Tree](/docs/剑指offer/Java/27_MirrorOfBinaryTree) |
| 28 | [Symmetrical Binary Tree](/docs/剑指offer/Java/28_SymmetricalBinaryTree) |
| 29 | [Print Matrix](/docs/剑指offer/Java/29_PrintMatrix) |
| 30 | [Min In Stack](/docs/剑指offer/Java/30_MinInStack) |
| 31 | [Stack Push Pop Order](/docs/剑指offer/Java/31_StackPushPopOrder) |
| 32_01 | [Print Tree From Top To Bottom](/docs/剑指offer/Java/32_01_PrintTreeFromTopToBottom) |
| 32_02 | [Print Trees In Lines](/docs/剑指offer/Java/32_02_PrintTreesInLines) |
| 32_03 | [Print Trees In Zigzag](/docs/剑指offer/Java/32_03_PrintTreesInZigzag) |
| 33 | [Squence Of BST](/docs/剑指offer/Java/33_SquenceOfBST) |
| 34 | [Path In Tree](/docs/剑指offer/Java/34_PathInTree) |
| 35 | [Copy Complex List](/docs/剑指offer/Java/35_CopyComplexList) |
| 36 | [Convert Binary Search Tree](/docs/剑指offer/Java/36_ConvertBinarySearchTree) |
| 39 | [More Than Half Number](/docs/剑指offer/Java/39_MoreThanHalfNumber) |
| 40 | [K Least Numbers](/docs/剑指offer/Java/40_KLeastNumbers) |
| 41 | [Stream Median](/docs/剑指offer/Java/41_StreamMedian) |
| 42 | [Greatest Sum Of Subarrays](/docs/剑指offer/Java/42_GreatestSumOfSubarrays) |
| 44 | [Digits In Sequence](/docs/剑指offer/Java/44_DigitsInSequence) |
| 45 | [Sort Array For Min Number](/docs/剑指offer/Java/45_SortArrayForMinNumber) |
| 46 | [Translate Numbers To Strings](/docs/剑指offer/Java/46_TranslateNumbersToStrings) |
| 47 | [Max Value Of Gifts](/docs/剑指offer/Java/47_MaxValueOfGifts) |
| 48 | [Longest Substring Without Dup](/docs/剑指offer/Java/48_LongestSubstringWithoutDup) |
| 52 | [First Common Nodes In Lists](/docs/剑指offer/Java/52_FirstCommonNodesInLists) |
| 53_01 | [Number Of K](/docs/剑指offer/Java/53_01_NumberOfK) |
| 53_02 | [Missing Number](/docs/剑指offer/Java/53_02_MissingNumber) |
| 53_03 | [Integer Identical To Index](/docs/剑指offer/Java/53_03_IntegerIdenticalToIndex) |
| 55_01 | [Tree Depth](/docs/剑指offer/Java/55_01_TreeDepth) |
| 55_02 | [Balanced Binary Tree](/docs/剑指offer/Java/55_02_BalancedBinaryTree) |
| 56_01 | [Numbers Appear Once](/docs/剑指offer/Java/56_01_NumbersAppearOnce) |
| 56_02 | [Number Appearing Once](/docs/剑指offer/Java/56_02_NumberAppearingOnce) |
| 57_01 | [Two Numbers With Sum](/docs/剑指offer/Java/57_01_TwoNumbersWithSum) |
| 57_02 | [Continuous Squence With Sum](/docs/剑指offer/Java/57_02_ContinuousSquenceWithSum) |
| 58_01 | [Reverse Words In Sentence](/docs/剑指offer/Java/58_01_ReverseWordsInSentence) |
| 58_02 | [Left Rotate String](/docs/剑指offer/Java/58_02_LeftRotateString) |
| 59_01 | [Max In Sliding Window](/docs/剑指offer/Java/59_01_MaxInSlidingWindow) |
| 61 | [Continous Cards](/docs/剑指offer/Java/61_ContinousCards) |
没有合适的资源?快使用搜索试试~ 我知道了~
温馨提示
数据结构学习资料分享 内容概览: 本次分享包涵了大学计算机相关专业必学的“数据结构”课程的一系列学习资料。主要包括: 算法代码:我们提供了多种数据结构的实现代码,包括数组、链表、栈、队列、树、图等。这些代码不仅能帮助你理解数据结构的基本概念,而且能让你明白如何在实际情况中应用这些数据结构。 笔记:详细且系统的笔记,涵盖了数据结构的各个方面,从基础概念到复杂的数据结构如堆、B树等。这些笔记有助于你系统地复习和学习数据结构。 相关书籍推荐:为了更深入地理解数据结构,我们推荐了几本经典的教材和参考书籍。这些书籍将帮助你建立完整的数据结构知识体系。 适用人群: 这份学习资料适用于所有大学计算机相关专业的学生,无论你是初学者还是已经有一定的数据结构基础。同时,对于对数据结构感兴趣的非专业人士,这份资料也是一个很好的起点。 使用建议: 结合理论和实践:在学习的过程中,请结合算法代码和理论知识。尝试自己编写代码实现数据结构,并在遇到问题时参考提供的代码。 由浅入深:建议先从基础的数据结构开始学习,如数组和链表,然后再学习更复杂的数据结构如树和图。 多做练习:数据结构是实践性很强的学科。通过多做练习,你可以更好地理解数据结构的基本概念和原理,并提高编程能力。
资源推荐
资源详情
资源评论
收起资源包目录
ApacheCN 数据结构与算法译文集.zip (734个子文件)
CNAME 17B
vue.css 15KB
prism-darcula.css 3KB
style.css 2KB
docsify-quick-page.css 736B
sidebar.min.css 476B
dark-mode.css 422B
back-to-top.css 421B
edit.css 328B
share.css 296B
Dockerfile 49B
.gitignore 1KB
index.html 3KB
404.html 74B
12-1.jpg 67KB
6-2.jpg 64KB
cover.jpg 36KB
17-3.jpg 32KB
11-2.jpg 31KB
4-1.jpg 29KB
5-2.jpg 28KB
5-3.jpg 28KB
5-1.jpg 27KB
8-1.jpg 22KB
11-1.jpg 19KB
3-1.jpg 19KB
17-2.jpg 18KB
6-3.jpg 15KB
13-1.jpg 13KB
17-1.jpg 12KB
6-1.jpg 8KB
docsify.min.js 100KB
share.js 17KB
docsify-clicker.js 17KB
search.min.js 7KB
docsify-sidebar-collapse.min.js 5KB
docsify-copy-code.min.js 4KB
prism-javascript.min.js 3KB
prism-sql.min.js 3KB
prism-perl.min.js 3KB
prism-python.min.js 2KB
docsify-apachecn-footer.js 2KB
prism-cpp.min.js 2KB
prism-java.min.js 2KB
prism-kotlin.min.js 1KB
prism-c.min.js 1KB
docsify-quick-page.js 1KB
dark-mode.js 1KB
back-to-top.js 611B
docsify-cnzz.js 454B
docsify-baidu-stat.js 452B
edit.js 437B
docsify-baidu-push.js 412B
book.json 5KB
SUMMARY.md 56KB
SUMMARY.md 18KB
17.md 18KB
14.md 18KB
NAV.md 17KB
3.md 16KB
6.md 14KB
16.md 13KB
13.md 13KB
4.md 12KB
11.md 12KB
2.md 12KB
004._median_of_two_sorted_arrays.md 11KB
8.md 11KB
15.md 11KB
12.md 11KB
10.md 10KB
SUMMARY.md 10KB
1.md 10KB
5.md 9KB
7.md 9KB
005._longest_palindromic_substring.md 8KB
9.md 7KB
0864._Shortest_Path_to_Get_All_Keys.md 6KB
0.md 6KB
010._regular_expression_matching.md 6KB
0828._Unique_Letter_String.md 6KB
287._Find_the_Duplicate_Number.md 6KB
0913._Cat_and_Mouse.md 6KB
0004._Median_of_Two_Sorted_Arrays.md 5KB
587._Erect_the_Fence.md 5KB
218._The_Skyline_Problem.md 5KB
README.md 5KB
0218._The_Skyline_Problem.md 5KB
39_MoreThanHalfNumber.md 5KB
0012._Integer_to_Roman.md 5KB
130._surrounded_regions.md 4KB
0068._Text_Justification.md 4KB
0127._Word_Ladde.md 4KB
0834._Sum_of_Distances_in_Tree.md 4KB
075._sort_colors.md 4KB
SUMMARY.md 4KB
031._next_permutation.md 4KB
380._Insert_Delete_GetRandom_O(1).md 4KB
40_KLeastNumbers.md 4KB
0854._K-Similar_Strings.md 4KB
共 734 条
- 1
- 2
- 3
- 4
- 5
- 6
- 8
资源评论
01红C
- 粉丝: 1637
- 资源: 1098
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功