算法基础、《剑指Offer》、leetcode，Java实现.zip

# algorithm-primer > > algorithm primer - 算法基础、Leetcode编程、剑指offer > # 目录 <!-- TOC --> - [算法基础](#summary/algorithm-summary.md) - [Leetcode编程](#Leetcode编程) * [**Leetcode编程源码**](leetcode/src/main/java/leetcode) * [Top 100 Liked Questions](#Top-100-Liked-Questions) * [Leetcode all questions](#All-Questions) * [Leetcode Summary](summary/leetcode-summary.md) * [Leetcode Category](#Leetcode-Category) * [数组与矩阵](#数组与矩阵) * [链表](#链表) * [栈与队列](#栈与队列) * [字符串](#字符串) * [哈希表](#哈希表) * [树](#树) * [二叉树](#二叉树) * [二叉搜索树](#二叉搜索树) * [字典树](#字典树) * [图](#图) * [位运算](#位运算) * [排序](#排序) * [排序应用](#排序应用) * [拓扑排序](#拓扑排序) * [二分查找](#二分查找) * [双指针](#双指针) * [贪心](#贪心) * [分治](#分治) * [搜索](#搜索) * [BFS](#BFS) * [DFS](#DFS) * [回溯](#回溯) * [递归与动态规划](#递归与动态规划) - [剑指offer](#剑指offer) * [**剑指offerV2源码**](interview-for-offer/src/main/java/offerV2) * [剑指offer V2](#剑指offer-V2) * [剑指offer V1](#剑指offer-V1) * [剑指offer Summary](summary/interviewforoffer-summary.md) * [剑指offer V2分类](#剑指offer-V2分类) * [数组](#剑指offer-数组与哈希表) * [链表](#剑指offer-链表) * [二叉树](#剑指offer-二叉树) * [栈与队列](#剑指offer-栈与队列) * [字符串](#剑指offer-字符串) * [位运算](#剑指offer-位运算) * [递归与动态规划](#剑指offer-递归与动态规划) - [参考](#参考) <!-- /TOC --> --- # Leetcode编程 ## Leetcode Category ### 栈与队列 | No | Problem | Solution | Difficulty | Tag | |------|---------|----------|------------|------| | 20 | 有效的括号 Valid Parentheses | [Java](leetcode/src/main/java/leetcode/_0020_ValidParentheses.java) | Easy | | | 94 | 二叉树的中序遍历 Binary Tree Inorder | [Java](leetcode/src/main/java/leetcode/_0094_BinaryTreeInorderTraversal.java) | Medium | | | 155 | 最小栈 Min Stack | [Java](leetcode/src/main/java/leetcode/_0155_MinStack.java) | Easy | | | 394 | 字符串编码 Decode String | [Java](leetcode/src/main/java/leetcode/_0394_DecodeString.java) | Medium | | ### 链表 | No | Problem | Solution | Difficulty | Tag | |------|---------|----------|------------|------| | 2 | 两数相加 Add Two Numbers | [Java](leetcode/src/main/java/leetcode/_0002_AddTwoNumbers.java) | Medium | | | 19 | 删除链表倒数第N个节点 Remove Nth Node From End of List | [Java](leetcode/src/main/java/leetcode/_0019_RemoveNthNodeFromEndOfList.java) | Medium | | | 21 | 合并两个有序链表 Merge Two Sorted Lists | [Java](leetcode/src/main/java/leetcode/_0021_MergeTwoSortedLists.java) | Easy | | | 141 | 判断链表是是否存在环 Linked List Cycle | [Java](leetcode/src/main/java/leetcode/_0141_LinkedListCycle.java) | Easy | | | 142 | 环形链表II Linked List Cycle II | [Java](leetcode/src/main/java/leetcode/_0142_LinkedListCycleII.java) | Medium | | | 148 | 排序链表 Sort List | [Java](leetcode/src/main/java/leetcode/_0148_SortList.java) | Medium | | | 160 | 相交链表 Intersection of Two Linked Lists | [Java](leetcode/src/main/java/leetcode/_0160_IntersectionOfTwoLinkedLists.java) | Easy | | | 206 | 反转链表 Reverse Linked List | [Java](leetcode/src/main/java/leetcode/_0206_ReverseLinkedList.java) | Easy | | | 234 | 回文链表 Palindrome Linked List | [Java](leetcode/src/main/java/leetcode/_0234_PalindromeLinkedList.java) | Easy | | ### 数组与矩阵 | No | Problem | Solution | Difficulty | Tag | |------|---------|----------|------------|------| | 105 | Construct Binary Tree from Preorder and Inorder Traversal | [Java](leetcode/src/main/java/leetcode/_0105_ConstructBinaryTreeFromPreorderAndInorderTraversal.java) | Medium | | | 121 | Best Time to Buy and Sell Stock | [Java](leetcode/src/main/java/leetcode/_0121_BestTimeToBuyAndSellSock.java) | Easy | | | 152 | Maximum Product Subarray | [Java](leetcode/src/main/java/leetcode/_0152_MaximumProductSubarray.java) | Medium | | | 169 | Majority Element | [Java](leetcode/src/main/java/leetcode/_0169_MajorityElement.java) | Easy | | | 238 | Product of Array Except Self | [Java](leetcode/src/main/java/leetcode/_0238_ProductOfArrayExceptSelf.java) | Medium | | | 283 | Move Zeroes | [Java](leetcode/src/main/java/leetcode/_0283_MoveZeroes.java) | Easy | | | 287 | Find the Duplicate Number | [Java](leetcode/src/main/java/leetcode/_0287_FindTheDuplicateNumber.java) | Medium | | | 448 | Find All Numbers Disappeared in an Array | [Java](leetcode/src/main/java/leetcode/_0448_FindAllNumbersDisappearedInAnArray.java) | Easy | | | 560 | Subarray Sum Equals K | [Java](leetcode/src/main/java/leetcode/_0560_SubarraySumEqualsK.java) | Medium | | | 581 | Shortest Unsorted Continuous Subarray | [Java](leetcode/src/main/java/leetcode/_581_ShortestUnsortedContinuousSubarray.java) | Easy | | ### 树 #### 二叉树 | No | Problem | Solution | Difficulty | Tag | |------|---------|----------|------------|------| | 94 | 二叉树的中序遍历 Binary Tree Inorder | [Java](leetcode/src/main/java/leetcode/_0094_BinaryTreeInorderTraversal.java) | Medium | | | 101 | 对称二叉树 Symmetric Tree | [Java](leetcode/src/main/java/leetcode/_0101_SymmetricTree.java) | Easy | | | 102 | 二叉树的层次遍历 Binary Tree Level Order Traversal | [Java](leetcode/src/main/java/leetcode/_0102_BinaryTreeLevelOrderTraversal.java) | Medium | | | 104 | 二叉树的最大深度 Maximum Depth of Binary Tree | [Java](leetcode/src/main/java/leetcode/_0104_MaximumDepthOfBinaryTree.java) | Easy | | | 105 | 从前序与中序遍历序列构造二叉树 Construct Binary Tree from Preorder and Inorder Traversal | [Java](leetcode/src/main/java/leetcode/_0105_ConstructBinaryTreeFromPreorderAndInorderTraversal.java) | Medium | | | 114 | 二叉树展开为链表 Flatten Binary Tree to Linked List | [Java](leetcode/src/main/java/leetcode/_0114_FlattenBinaryTreeToLinkedList.java) | Medium | | | 124 | 二叉树中的最大路径和 Binary Tree Maximum Path Sum | [Java](leetcode/src/main/java/leetcode/_0124_BinaryTreeMaximumPathSum.java) | Hard | | | 226 | 翻转二叉树 Invert Binary Tree | [Java](leetcode/src/main/java/leetcode/_0226_InvertBinaryTree.java) | Easy | | | 236 | 二叉树的最近公共祖先 Lowest Common Ancestor of a Binary Tree | [Java](leetcode/src/main/java/leetcode/_0236_LowestCommonAncestorOfABinaryTree.java) | Medium | | | 257 | 二叉树路径 Binary Tree Paths | [Java](leetcode/src/main/java/leetcode/_0257_BinaryTreePaths.java) | Easy | | | 337 | 打家劫舍 III House Robber III | [Java](leetcode/src/main/java/leetcode/_0337_HouseRobberIII.java) | Medium | | | 437 | 路径总和 III Path Sum III | [Java](leetcode/src/main/java/leetcode/_0437_PathSumIII.java) | Easy | | | 543 | 二叉树的直径 Diameter of Binary Tree | [Java](leetcode/src/main/java/leetcode/_0543_DiameterOfBinaryTree.java) | Easy | | | 617 | 合并二叉树 Merge Two Binary Trees | [Java](leetcode/src/main/java/leetcode/_0617_MergeTwoBinaryTrees.java) | Easy | | #### 二叉搜索树 | No | Problem | Solution | Difficulty | Tag | |------|---------|----------|------------|------| | 96 | 不同的二叉搜索树 Unique Binary Search Trees | [Java](leetcode/src/main/java/leetcode/_0096_UniqueBinarySearchTrees.java) | Medium | | | 98 | 验证二叉搜索树 Validate Binary Search Tree | [Java](leetcode/src/m