文件名称：lintcodeleetcode好-lintcode:代码
文件大小：93KB
文件格式：ZIP
更新时间：2024-07-20 23:13:30
系统开源
lintcode leetcode 好 lintcode 题解 大纲 subset/substring(strStr两道) BinarySearch BFS DFS more Linked List Array Two Pointer Hash Queue DP PS:这里只在每个文件夹的readme中写小部分笔记，更多刷题相关的总结在这里： PPS:如果是和leetcode重复的题，都写在出门左转的repo里，就不重复放题解了，不同平台输入输出稍有不同，留意一下就好
【文件预览】：
lintcode-master
----L5-DFS-STACK()
--------L5.md(5KB)
--------ExpressionExpand.java(2KB)
--------FlattenNestedListIterator.java(2KB)
----L3-BinaryTree()
--------valieBST.java(3KB)
--------binaryTreePathSum2.java(2KB)
--------BinaryTreePathSum.java(2KB)
--------convertBSTtoDLL.java(2KB)
--------binaryTreePathSum3.java(2KB)
--------flattenBinaryTreeToLinkedList.java(2KB)
--------postorder.java(2KB)
--------inorder.java(1KB)
--------lowestCommonAncester.java(4KB)
--------lowestCommonAncester2.java(1KB)
--------subtreeWithMaxAve.java(1006B)
--------maxDepOfBinaryTree.java(672B)
--------aboutTree.java(34KB)
--------binaryTreePath.java(2KB)
--------balancedBinaryTree.java(2KB)
--------preorder.java(2KB)
--------binaryTreeLongestConsecutiveSequence.java(4KB)
--------lowestCommonAncester3.java(2KB)
--------minSubtree.java(2KB)
--------L3.md(23KB)
----.DS_Store(8KB)
----L6-Array()
--------L6.md(0B)
--------arrayPartition.java(697B)
----L-sort()
--------quickSort.java(942B)
--------mergeSort.java(1KB)
--------L-sort.md(692B)
----L1-Subset-DFS()
--------permutation.java(2KB)
--------combinationSum2.java(2KB)
--------combinationSum.java(2KB)
--------strStr.java(1KB)
--------permutation2.java(2KB)
--------strStr2.java(2KB)
--------subset.java(1KB)
--------palindromePartitioning.java(1KB)
--------L1.md(13KB)
--------subset2.java(820B)
----ReadMe.md(432B)
----L4-BFS()
--------BinaryTreeSerialization.java(3KB)
--------NumberOfIslands.java(2KB)
--------BuildPostOffice2.java(4KB)
--------WordLadder.java(2KB)
--------ZombieInMatrix.java(2KB)
--------SearchGraphNodes.java(1KB)
--------CourseSchedule2.java(1KB)
--------CourseSchedule.java(2KB)
--------TopologicalSort.java(2KB)
--------KnightShortestPath.java(2KB)
--------ConvertBinaryTreeToLinkedListByDepth.java(2KB)
--------L-4.md(26KB)
--------graphValidTree.java(2KB)
--------BinaryTreeZigZagLevelOrder.java(3KB)
--------BinaryTreeLevelOrder2.java(1KB)
--------BinaryTreeLevelOrder.java(807B)
--------CloneGraph.java(2KB)
----L2-BinarySearch()
--------sqrt.java(461B)
--------L2.md(17KB)
--------firstPositionOfTarget.java(767B)
--------searchRotatedSortedArray.java(2KB)
--------searchRotatedSortedArray2.java(1006B)
--------search2Dmatrix2.java(805B)
--------search2Dmatrix.java(1KB)
--------lastPositionOfTarget.java(2KB)
--------maximumAverageSubarray.java(1KB)
--------searchInBigSortedArray.java(1004B)
--------dropEggs.java(316B)
--------recoverRotatedSortedArray.java(746B)
--------findMinInRotatedArray.java(585B)
--------firstBadVersion.java(653B)
--------findPeak.java(566B)
--------woodCut.java(915B)
--------rotateString.java(627B)
--------copyBooks.java(1KB)