From f0a83a56b9eafcf5a520e14022799a10f7108dfb Mon Sep 17 00:00:00 2001
From: andyalgorithm <1141338015@qq.com>
Date: Sun, 16 Mar 2025 23:27:14 +0800
Subject: [PATCH] update
---
algorithm/pom.xml | 38 ++++++
.../BinaryTreeLevelOrderTraversal.java | 49 +++++++
.../BinaryTreeLevelOrderTraversalII.java | 44 +++++++
.../BinaryTreeZigzagLevelOrderTraversal.java | 58 +++++++++
.../main/java/BFS_DFS/CountSubIslands.java | 51 ++++++++
.../src/main/java/BFS_DFS/MaxAreaIsland.java | 44 +++++++
.../java/BFS_DFS/MinimumDepthBinaryTree.java | 40 ++++++
.../java/BFS_DFS/NumberClosedIslands.java | 51 ++++++++
.../java/BFS_DFS/NumberDistinctIslands.java | 59 +++++++++
.../src/main/java/BFS_DFS/NumberEnclaves.java | 54 ++++++++
.../src/main/java/BFS_DFS/NumberIslands.java | 41 ++++++
.../src/main/java/BFS_DFS/OpenTheLock.java | 70 ++++++++++
.../src/main/java/BFS_DFS/SlidingPuzzle.java | 98 ++++++++++++++
.../main/java/BFS_DFS/SurroundedRegions.java | 70 ++++++++++
.../src/main/java/DP/BloodSimilarity.java | 42 ++++++
algorithm/src/main/java/DP/DisjointLines.java | 41 ++++++
algorithm/src/main/java/DP/Envelops.java | 28 ++++
algorithm/src/main/java/DP/IsSubsequence.java | 27 ++++
.../java/DP/LongestCommonSubsequence.java | 25 ++++
.../java/DP/LongestCommonSubsequenceII.java | 40 ++++++
.../src/main/java/DP/MinFallingPathSum.java | 65 +++++++++
.../src/main/java/DP/MinFallingPathSum2.java | 49 +++++++
.../src/main/java/DP/MinFallingPathSumII.java | 55 ++++++++
algorithm/src/main/java/DP/MinPathSum.java | 42 ++++++
.../main/java/DP/MinimumTriangleTotal.java | 52 ++++++++
.../main/java/DP/MinimumTriangleTotalII.java | 47 +++++++
.../src/main/java/DP/PalindromeList.java | 65 +++++++++
algorithm/src/main/java/DP/ReverseNode.java | 18 +++
algorithm/src/main/java/DP/ReverseNode2.java | 25 ++++
algorithm/src/main/java/DP/ReverseNode3.java | 36 +++++
.../src/main/java/DP/ReverseNodeKGroup.java | 43 ++++++
.../main/java/DP/RussianDollEnvelopes.java | 45 +++++++
.../java/DP/UniquePathsWithObstacles.java | 53 ++++++++
.../main/java/alibaba/DuplicateLength.java | 30 +++++
.../src/main/java/alibaba/ThreadPrintABC.java | 55 ++++++++
.../main/java/alibaba/ThreadPrintABC2.java | 48 +++++++
.../main/java/alibaba/ThreadPrintCharNum.java | 56 ++++++++
.../main/java/alibaba/ThreadPrintNums.java | 46 +++++++
.../java/array/binarySearch/EatBanana.java | 55 ++++++++
.../array/binarySearch/IsSubsequence.java | 29 +++++
.../java/array/binarySearch/PeakArray.java | 42 ++++++
.../array/binarySearch/PreimageSizeZF.java | 51 ++++++++
.../binarySearch/SearchInsertPosition.java | 71 ++++++++++
.../java/array/binarySearch/SearchMatrix.java | 88 +++++++++++++
.../array/binarySearch/SearchPosition.java | 33 +++++
.../java/array/binarySearch/SearchRange.java | 53 ++++++++
.../array/binarySearch/ShipWithinDays.java | 48 +++++++
.../java/array/binarySearch/TailingZeros.java | 20 +++
.../java/array/other/AdvantageShuffle.java | 49 +++++++
.../array/other/ContainerWithMostWater.java | 33 +++++
.../other/IntervalListIntersections.java | 35 +++++
.../java/array/other/MaxRepeatSubString.java | 33 +++++
.../other/RemoveDuplicateSortedArray.java | 29 +++++
.../java/array/other/Search2DMatrixII.java | 26 ++++
.../java/array/other/SquaresSortedArray.java | 27 ++++
.../java/array/other/TrappingRainWater.java | 45 +++++++
.../java/array/other/TwoSumLessThanK.java | 30 +++++
.../java/array/slideWindow/FindAnagrams.java | 53 ++++++++
.../slideWindow/LengthOfLongestSubstring.java | 30 +++++
.../array/slideWindow/MinWindowSubstring.java | 57 ++++++++
.../java/array/slideWindow/MinimumWindow.java | 60 +++++++++
.../java/array/slideWindow/Permutation.java | 50 +++++++
.../slideWindow/SlidingWindowMaximum.java | 84 ++++++++++++
.../main/java/backTrack/CombinationSum.java | 38 ++++++
.../src/main/java/backTrack/Combinations.java | 49 +++++++
.../java/backTrack/GenerateParentheses.java | 54 ++++++++
.../backTrack/MaximumDepthBinaryTree.java | 22 ++++
.../src/main/java/backTrack/NQueues.java | 77 +++++++++++
.../backTrack/PartitionKEqualSumSubsets.java | 53 ++++++++
.../src/main/java/backTrack/Permutations.java | 40 ++++++
.../src/main/java/backTrack/Subsets.java | 24 ++++
.../src/main/java/backTrack/SudokuSolver.java | 70 ++++++++++
.../src/main/java/backTrack/TargetSum.java | 38 ++++++
.../src/main/java/backTrack/TargetSum2.java | 38 ++++++
.../main/java/binaryHeap/KthLargestData.java | 27 ++++
.../java/binaryHeap/KthLargestElement.java | 44 +++++++
.../main/java/binaryHeap/MaxFrequency.java | 18 +++
.../src/main/java/binaryHeap/MedianData.java | 49 +++++++
.../src/main/java/binaryHeap/MinStack.java | 46 +++++++
.../src/main/java/binaryHeap/SeatReserve.java | 38 ++++++
.../main/java/binaryHeap/SingleThreadCPU.java | 91 +++++++++++++
.../BinaryTreeLevelOrderTraversal.java | 30 +++++
.../BinaryTreePostorderTraversal.java | 28 ++++
.../BinaryTreeZigzagLevelOrderTraversal.java | 39 ++++++
.../java/binaryTree/DiameterBinaryTree.java | 24 ++++
.../FlattenBinaryTreeToLinkedList.java | 37 ++++++
.../java/binaryTree/InorderTraversal.java | 46 +++++++
.../java/binaryTree/InvertBinaryTree.java | 28 ++++
.../java/binaryTree/LevelOrderTraversal.java | 45 +++++++
.../main/java/binaryTree/MaximumDepth.java | 15 +++
.../java/binaryTree/MaximumDepthNTree.java | 10 ++
.../binaryTree/MinimumDepthBinaryTree.java | 25 ++++
.../src/main/java/binaryTree/SameTree.java | 19 +++
.../src/main/java/binaryTree/SameTree2.java | 30 +++++
.../SerializeAndDeserializeBinaryTree.java | 66 ++++++++++
.../src/main/java/binaryTree/TreeNode.java | 82 ++++++++++++
.../binaryTree/ZigzagLevelOrderTraversal.java | 44 +++++++
.../main/java/competition/AverageValue.java | 22 ++++
.../InsertDeleteGetRandom.java | 39 ++++++
.../java/dataStructureDesign/LFUCache.java | 86 ++++++++++++
.../java/dataStructureDesign/LRUCache.java | 86 ++++++++++++
.../java/dataStructureDesign/LRUCache2.java | 54 ++++++++
.../MaximumFrequencyStack.java | 48 +++++++
.../java/dataStructureDesign/MinStack.java | 36 +++++
.../main/java/differenceArray/CarPooling.java | 38 ++++++
.../java/differenceArray/FlightBooking.java | 32 +++++
.../main/java/differenceArray/RangeAdd.java | 36 +++++
.../main/java/graphTheory/AllPathList.java | 46 +++++++
.../java/images/binary-tree-traversal.jpg | Bin 0 -> 254010 bytes
algorithm/src/main/java/images/graph.jpg | Bin 0 -> 19630 bytes
algorithm/src/main/java/images/plugin4.png | Bin 0 -> 1640774 bytes
...72\214\345\217\211\346\240\221plugin1.png" | Bin 0 -> 253839 bytes
...72\214\345\217\211\346\240\221plugin2.png" | Bin 0 -> 581748 bytes
...1\346\240\221\344\276\213\345\255\220.jpg" | Bin 0 -> 12823 bytes
...\346\240\221\346\241\210\344\276\2132.png" | Bin 0 -> 32606 bytes
...1\346\240\221\351\201\215\345\216\206.gif" | Bin 0 -> 97354 bytes
...346\240\221\351\201\215\345\216\2062.jpeg" | Bin 0 -> 106910 bytes
...\344\272\214\345\217\211\346\240\221.jpeg" | Bin 0 -> 106910 bytes
...\347\273\255\351\201\215\345\216\206.jpeg" | Bin 0 -> 105784 bytes
...345\272\217\351\201\215\345\216\2062.jpeg" | Bin 0 -> 103512 bytes
...\350\275\254\351\223\276\350\241\2502.jpg" | Bin 0 -> 80907 bytes
...\347\244\272\346\226\271\346\263\225.jpeg" | Bin 0 -> 70648 bytes
.../src/main/java/images/\345\272\246.jpg" | Bin 0 -> 19630 bytes
...\347\216\257\351\201\215\345\216\206.jpeg" | Bin 0 -> 75882 bytes
...4N\344\270\252\350\212\202\347\202\271.md" | 11 ++
...07\345\272\217\351\223\276\350\241\250.md" | 22 ++++
.../doublePointer/AddTwoNumbers.java | 45 +++++++
.../doublePointer/AddTwoNumbers2.java | 89 +++++++++++++
.../doublePointer/DeleteNthNode.java | 32 +++++
.../doublePointer/LinkedListCycle.java | 29 +++++
.../doublePointer/LinkedListCycleII.java | 31 +++++
.../doublePointer/LinkedListIntersect.java | 28 ++++
.../linkedList/doublePointer/ListNode.java | 43 ++++++
.../doublePointer/MergeKSortedList.java | 36 +++++
.../doublePointer/MergeSortedList.java | 34 +++++
.../linkedList/doublePointer/MiddleNode.java | 21 +++
.../doublePointer/PalindromeLinkedList.java | 4 +
.../doublePointer/RemoveDuplicate.java | 21 +++
.../doublePointer/ReverseLinkedListII.java | 4 +
.../doublePointer/ReverseNodesInKGroup.java | 14 ++
...0+\345\217\214\346\214\207\351\222\210.md" | 54 ++++++++
.../src/main/java/multiThread/FizzBuzz.java | 91 +++++++++++++
.../src/main/java/multiThread/FizzBuzzII.java | 123 ++++++++++++++++++
.../main/java/multiThread/FizzBuzzIII.java | 103 +++++++++++++++
.../multiThread/PrintFooBarAlternately.java | 79 +++++++++++
.../main/java/multiThread/PrintInOrder.java | 117 +++++++++++++++++
.../main/java/multiThread/PrintInOrder2.java | 107 +++++++++++++++
.../main/java/multiThread/PrintInOrder3.java | 100 ++++++++++++++
.../java/multiThread/PrintZeroOddEven.java | 68 ++++++++++
.../src/main/java/multiThread/ProduceH2O.java | 30 +++++
algorithm/src/main/java/nSum/NSum.java | 53 ++++++++
algorithm/src/main/java/nSum/ThreeSum.java | 51 ++++++++
algorithm/src/main/java/nSum/TwoSum.java | 60 +++++++++
.../src/main/java/other/IsIsomorphic.java | 40 ++++++
.../src/main/java/prefixSum/MatrixSum.java | 33 +++++
.../src/main/java/prefixSum/NumArray.java | 48 +++++++
.../src/main/java/prefixSum/NumMatrix.java | 32 +++++
.../main/java/prefixSum/ProductOfNumbers.java | 39 ++++++
.../src/main/java/stack_queue/EvalRPN.java | 41 ++++++
.../ImplementQueueUsingStacks.java | 48 +++++++
.../ImplementStackUsingQueues.java | 44 +++++++
.../stack_queue/LongestValidParentheses.java | 40 ++++++
.../java/stack_queue/MinAddMakeValid.java | 29 +++++
.../src/main/java/stack_queue/MinStack.java | 41 ++++++
...MinimumInsertionsToBalanceParentheses.java | 38 ++++++
.../main/java/stack_queue/SimplifyPath.java | 42 ++++++
.../java/stack_queue/SlidingWindowMax.java | 55 ++++++++
.../java/stack_queue/ValidParentheses.java | 35 +++++
.../BinaryTreeLevelOrderTraversalIITest.java | 29 +++++
.../BinaryTreeLevelOrderTraversalTest.java | 30 +++++
...naryTreeZigzagLevelOrderTraversalTest.java | 61 +++++++++
.../java/BSF_DSF/CountSubIslandsTest.java | 53 ++++++++
.../test/java/BSF_DSF/MaxAreaIslandTest.java | 38 ++++++
.../BSF_DSF/MinimumDepthBinaryTreeTest.java | 19 +++
.../java/BSF_DSF/NumberClosedIslandsTest.java | 25 ++++
.../BSF_DSF/NumberDistinctIslandsTest.java | 38 ++++++
.../test/java/BSF_DSF/NumberEnclavesTest.java | 22 ++++
.../test/java/BSF_DSF/NumberIslandsTest.java | 37 ++++++
.../test/java/BSF_DSF/OpenTheLockTest.java | 50 +++++++
.../test/java/BSF_DSF/SlidingPuzzleTest.java | 41 ++++++
.../java/BSF_DSF/SurroundedRegionsTest.java | 31 +++++
.../src/test/java/DP/BloodSimilarityTest.java | 15 +++
.../src/test/java/DP/DisjointLinesTest.java | 35 +++++
algorithm/src/test/java/DP/EnvelopsTest.java | 4 +
.../src/test/java/DP/IsSubsequenceTest.java | 25 ++++
.../DP/LongestCommonSubsequenceIITest.java | 35 +++++
.../java/DP/LongestCommonSubsequenceTest.java | 35 +++++
.../test/java/DP/MinFallingPathSum2Test.java | 42 ++++++
.../test/java/DP/MinFallingPathSumIITest.java | 39 ++++++
.../test/java/DP/MinFallingPathSumTest.java | 41 ++++++
.../src/test/java/DP/MinPathSumTest.java | 35 +++++
.../java/DP/MinimumTriangleTotalIITest.java | 50 +++++++
.../java/DP/MinimumTriangleTotalTest.java | 52 ++++++++
.../src/test/java/DP/PalindromeListTest.java | 59 +++++++++
.../src/test/java/DP/ReverseNode2Test.java | 37 ++++++
.../src/test/java/DP/ReverseNode3Test.java | 39 ++++++
.../test/java/DP/ReverseNodeKGroupTest.java | 28 ++++
.../src/test/java/DP/ReverseNodeTest.java | 32 +++++
.../java/DP/RussianDollEnvelopesTest.java | 4 +
.../java/DP/UniquePathsWithObstaclesTest.java | 40 ++++++
algorithm/src/test/java/JavaStudy.java | 10 ++
.../java/alibaba/DuplicateLengthTest.java | 43 ++++++
.../array/binarySearch/EatBananaTest.java | 33 +++++
.../array/binarySearch/IsSubsequenceTest.java | 26 ++++
.../array/binarySearch/PeakArrayTest.java | 30 +++++
.../binarySearch/PreimageSizeZFTest.java | 39 ++++++
.../SearchInsertPositionTest.java | 49 +++++++
.../array/binarySearch/SearchMatrixTest.java | 53 ++++++++
.../binarySearch/SearchPositionTest.java | 30 +++++
.../array/binarySearch/SearchRangeTest.java | 44 +++++++
.../binarySearch/ShipWithinDaysTest.java | 30 +++++
.../array/binarySearch/TailingZerosTest.java | 27 ++++
.../array/other/AdvantageShuffleTest.java | 28 ++++
.../other/ContainerWithMostWaterTest.java | 16 +++
.../other/IntervalListIntersectionsTest.java | 29 +++++
.../array/other/MaxRepeatSubStringTest.java | 15 +++
.../other/RemoveDuplicateSortedArrayTest.java | 18 +++
.../array/other/Search2DMatrixIITest.java | 41 ++++++
.../array/other/SquaresSortedArrayTest.java | 18 +++
.../array/other/TrappingRainWaterTest.java | 24 ++++
.../java/array/other/TwoSumLessThanKTest.java | 26 ++++
.../array/slideWIndow/FindAnagramsTest.java | 43 ++++++
.../LengthOfLongestSubstringTest.java | 32 +++++
.../slideWIndow/MinWindowSubstringTest.java | 30 +++++
.../array/slideWIndow/MinimumWindowTest.java | 24 ++++
.../array/slideWIndow/PermutationTest.java | 17 +++
.../slideWIndow/SlidingWindowMaximumTest.java | 18 +++
.../java/backTrack/CombinationSumTest.java | 45 +++++++
.../test/java/backTrack/CombinationsTest.java | 20 +++
.../backTrack/GenerateParenthesesTest.java | 18 +++
.../backTrack/MaximumDepthBinaryTreeTest.java | 4 +
.../src/test/java/backTrack/NQueuesTest.java | 32 +++++
.../PartitionKEqualSumSubsetsTest.java | 26 ++++
.../test/java/backTrack/PermutationsTest.java | 28 ++++
.../src/test/java/backTrack/SubsetsTest.java | 29 +++++
.../test/java/backTrack/SudokuSolverTest.java | 47 +++++++
.../test/java/backTrack/TargetSum2Test.java | 17 +++
.../test/java/backTrack/TargetSumTest.java | 17 +++
.../java/binaryHeap/KthLargestDataTest.java | 39 ++++++
.../binaryHeap/KthLargestElementTest.java | 23 ++++
.../test/java/binaryHeap/LRUCacheTest.java | 4 +
.../java/binaryHeap/MaxFrequencyTest.java | 4 +
.../test/java/binaryHeap/MedianDataTest.java | 26 ++++
.../java/binaryHeap/MergeSortedListsTest.java | 9 ++
.../test/java/binaryHeap/MinStackTest.java | 32 +++++
.../test/java/binaryHeap/SeatReserveTest.java | 42 ++++++
.../java/binaryHeap/SingleThreadCPUTest.java | 31 +++++
.../BinaryTreeLevelOrderTraversalTest.java | 25 ++++
.../BinaryTreePostorderTraversalTest.java | 4 +
...naryTreeZigzagLevelOrderTraversalTest.java | 25 ++++
.../binaryTree/DiameterBinaryTreeTest.java | 17 +++
.../FlattenBinaryTreeToLinkedListTest.java | 21 +++
.../java/binaryTree/InorderTraversalTest.java | 14 ++
.../src/test/java/binaryTree/IntegerTest.java | 18 +++
.../java/binaryTree/InvertBinaryTreeTest.java | 21 +++
.../binaryTree/MaximumDepthNTreeTest.java | 4 +
.../MinimumDepthBinaryTreeTest.java | 17 +++
.../test/java/binaryTree/SameTree2Test.java | 19 +++
...SerializeAndDeserializeBinaryTreeTest.java | 22 ++++
.../FlattenNestedListIterator.java | 68 ++++++++++
.../InsertDeleteGetRandomTest.java | 19 +++
.../dataStructureDesign/LFUCacheTest.java | 23 ++++
.../dataStructureDesign/LRUCache2Test.java | 34 +++++
.../dataStructureDesign/LRUCacheTest.java | 34 +++++
.../java/differenceArray/CarPoolingTest.java | 29 +++++
.../differenceArray/FlightBookingTest.java | 21 +++
.../java/differenceArray/RangeAddTest.java | 21 +++
.../java/graphTherory/AllPathListTest.java | 4 +
.../doublePointer/AddTwoNumbers2Test.java | 79 +++++++++++
.../doublePointer/AddTwoNumbersTest.java | 79 +++++++++++
.../doublePointer/DeleteNthNodeTest.java | 27 ++++
.../doublePointer/LinkedListCycleIITest.java | 46 +++++++
.../doublePointer/LinkedListCycleTest.java | 50 +++++++
.../LinkedListIntersectTest.java | 4 +
.../doublePointer/MergeKSortedListTest.java | 39 ++++++
.../doublePointer/MergeSortedListTest.java | 43 ++++++
.../doublePointer/MiddleNodeTest.java | 29 +++++
.../doublePointer/RemoveDuplicateTest.java | 43 ++++++
algorithm/src/test/java/nSum/NSumTest.java | 87 +++++++++++++
.../src/test/java/nSum/ThreeSumTest.java | 52 ++++++++
algorithm/src/test/java/nSum/TwoSumTest.java | 52 ++++++++
.../src/test/java/other/IsIsomorphicTest.java | 25 ++++
.../test/java/prefixSum/MatrixSumTest.java | 27 ++++
.../src/test/java/prefixSum/NumArrayTest.java | 23 ++++
.../test/java/prefixSum/NumMatrixTest.java | 34 +++++
.../java/prefixSum/ProductOfNumbersTest.java | 32 +++++
.../test/java/stack_queue/EvalRPNTest.java | 33 +++++
.../ImplementQueueUsingStacksTest.java | 22 ++++
.../ImplementStackUsingQueuesTest.java | 23 ++++
.../LongestValidParenthesesTest.java | 37 ++++++
.../java/stack_queue/MinAddMakeValidTest.java | 30 +++++
.../test/java/stack_queue/MinStackTest.java | 32 +++++
...mumInsertionsToBalanceParenthesesTest.java | 30 +++++
.../src/test/java/stack_queue/QueueTest.java | 55 ++++++++
.../java/stack_queue/SimplifyPathTest.java | 41 ++++++
.../stack_queue/SlidingWindowMaxTest.java | 22 ++++
.../stack_queue/ValidParenthesesTest.java | 40 ++++++
.../BinaryTreeLevelOrderTraversal.class | Bin 0 -> 1623 bytes
.../BinaryTreeLevelOrderTraversalII.class | Bin 0 -> 1660 bytes
.../BinaryTreeZigzagLevelOrderTraversal.class | Bin 0 -> 1760 bytes
.../classes/BFS_DFS/CountSubIslands.class | Bin 0 -> 959 bytes
.../classes/BFS_DFS/MaxAreaIsland.class | Bin 0 -> 903 bytes
.../BFS_DFS/MinimumDepthBinaryTree.class | Bin 0 -> 1105 bytes
.../classes/BFS_DFS/NumberClosedIslands.class | Bin 0 -> 952 bytes
.../BFS_DFS/NumberDistinctIslands.class | Bin 0 -> 2075 bytes
.../classes/BFS_DFS/NumberEnclaves.class | Bin 0 -> 929 bytes
.../classes/BFS_DFS/NumberIslands.class | Bin 0 -> 800 bytes
.../target/classes/BFS_DFS/OpenTheLock.class | Bin 0 -> 2088 bytes
.../classes/BFS_DFS/SlidingPuzzle.class | Bin 0 -> 2326 bytes
.../classes/BFS_DFS/SurroundedRegions.class | Bin 0 -> 1139 bytes
.../target/classes/DP/BloodSimilarity.class | Bin 0 -> 1667 bytes
.../target/classes/DP/DisjointLines.class | Bin 0 -> 1013 bytes
algorithm/target/classes/DP/Envelops$1.class | Bin 0 -> 826 bytes
algorithm/target/classes/DP/Envelops.class | Bin 0 -> 570 bytes
.../target/classes/DP/IsSubsequence.class | Bin 0 -> 830 bytes
.../classes/DP/LongestCommonSubsequence.class | Bin 0 -> 926 bytes
.../DP/LongestCommonSubsequenceII.class | Bin 0 -> 1225 bytes
.../target/classes/DP/MinFallingPathSum.class | Bin 0 -> 1284 bytes
.../classes/DP/MinFallingPathSum2.class | Bin 0 -> 1195 bytes
.../classes/DP/MinFallingPathSumII.class | Bin 0 -> 1198 bytes
algorithm/target/classes/DP/MinPathSum.class | Bin 0 -> 985 bytes
.../classes/DP/MinimumTriangleTotal.class | Bin 0 -> 1661 bytes
.../classes/DP/MinimumTriangleTotalII.class | Bin 0 -> 1612 bytes
.../target/classes/DP/PalindromeList.class | Bin 0 -> 1106 bytes
algorithm/target/classes/DP/ReverseNode.class | Bin 0 -> 630 bytes
.../target/classes/DP/ReverseNode2.class | Bin 0 -> 714 bytes
.../target/classes/DP/ReverseNode3.class | Bin 0 -> 1056 bytes
.../target/classes/DP/ReverseNodeKGroup.class | Bin 0 -> 1075 bytes
.../classes/DP/RussianDollEnvelopes$1.class | Bin 0 -> 909 bytes
.../classes/DP/RussianDollEnvelopes.class | Bin 0 -> 658 bytes
.../classes/DP/UniquePathsWithObstacles.class | Bin 0 -> 961 bytes
.../classes/alibaba/DuplicateLength.class | Bin 0 -> 1311 bytes
.../classes/alibaba/ThreadPrintABC$1.class | Bin 0 -> 655 bytes
.../classes/alibaba/ThreadPrintABC.class | Bin 0 -> 2226 bytes
.../classes/alibaba/ThreadPrintABC2.class | Bin 0 -> 2236 bytes
.../classes/alibaba/ThreadPrintCharNum.class | Bin 0 -> 2230 bytes
.../classes/alibaba/ThreadPrintNums.class | Bin 0 -> 1847 bytes
.../array/binarySearch/EatBanana.class | Bin 0 -> 1035 bytes
.../array/binarySearch/IsSubsequence.class | Bin 0 -> 739 bytes
.../array/binarySearch/PeakArray.class | Bin 0 -> 573 bytes
.../array/binarySearch/PreimageSizeZF.class | Bin 0 -> 938 bytes
.../binarySearch/SearchInsertPosition.class | Bin 0 -> 692 bytes
.../array/binarySearch/SearchMatrix.class | Bin 0 -> 832 bytes
.../array/binarySearch/SearchPosition.class | Bin 0 -> 622 bytes
.../array/binarySearch/SearchRange.class | Bin 0 -> 893 bytes
.../array/binarySearch/ShipWithinDays.class | Bin 0 -> 998 bytes
.../array/binarySearch/TailingZeros.class | Bin 0 -> 499 bytes
.../array/other/AdvantageShuffle.class | Bin 0 -> 2446 bytes
.../array/other/ContainerWithMostWater.class | Bin 0 -> 848 bytes
.../other/IntervalListIntersections.class | Bin 0 -> 1384 bytes
.../array/other/MaxRepeatSubString.class | Bin 0 -> 1100 bytes
.../other/RemoveDuplicateSortedArray.class | Bin 0 -> 642 bytes
.../array/other/Search2DMatrixII.class | Bin 0 -> 611 bytes
.../array/other/SquaresSortedArray.class | Bin 0 -> 703 bytes
.../array/other/TrappingRainWater.class | Bin 0 -> 893 bytes
.../classes/array/other/TwoSumLessThanK.class | Bin 0 -> 714 bytes
.../array/slideWindow/FindAnagrams.class | Bin 0 -> 1971 bytes
.../LengthOfLongestSubstring.class | Bin 0 -> 1449 bytes
.../slideWindow/MinWindowSubstring.class | Bin 0 -> 1907 bytes
.../array/slideWindow/MinimumWindow.class | Bin 0 -> 814 bytes
.../array/slideWindow/MonotonicMinQueue.class | Bin 0 -> 1109 bytes
.../array/slideWindow/MonotonicQueue.class | Bin 0 -> 1110 bytes
.../array/slideWindow/Permutation.class | Bin 0 -> 1671 bytes
.../slideWindow/SlidingWindowMaximum.class | Bin 0 -> 1254 bytes
.../classes/backTrack/CombinationSum.class | Bin 0 -> 1552 bytes
.../classes/backTrack/Combinations.class | Bin 0 -> 1722 bytes
.../backTrack/GenerateParentheses.class | Bin 0 -> 1445 bytes
.../backTrack/MaximumDepthBinaryTree.class | Bin 0 -> 721 bytes
.../target/classes/backTrack/NQueues.class | Bin 0 -> 2026 bytes
.../backTrack/PartitionKEqualSumSubsets.class | Bin 0 -> 1009 bytes
.../classes/backTrack/Permutations.class | Bin 0 -> 1549 bytes
.../target/classes/backTrack/Subsets.class | Bin 0 -> 1445 bytes
.../classes/backTrack/SudokuSolver.class | Bin 0 -> 1105 bytes
.../target/classes/backTrack/TargetSum.class | Bin 0 -> 760 bytes
.../target/classes/backTrack/TargetSum2.class | Bin 0 -> 734 bytes
.../classes/binaryHeap/KthLargestData.class | Bin 0 -> 1777 bytes
.../binaryHeap/KthLargestElement.class | Bin 0 -> 1720 bytes
.../classes/binaryHeap/MaxFrequency.class | Bin 0 -> 444 bytes
.../classes/binaryHeap/MedianData.class | Bin 0 -> 2118 bytes
.../target/classes/binaryHeap/MinStack.class | Bin 0 -> 1200 bytes
.../classes/binaryHeap/SeatReserve.class | Bin 0 -> 1789 bytes
.../binaryHeap/SingleThreadCPU$1Task.class | Bin 0 -> 724 bytes
.../classes/binaryHeap/SingleThreadCPU.class | Bin 0 -> 2653 bytes
.../BinaryTreeLevelOrderTraversal.class | Bin 0 -> 1484 bytes
.../BinaryTreePostorderTraversal.class | Bin 0 -> 1296 bytes
.../BinaryTreeZigzagLevelOrderTraversal.class | Bin 0 -> 1577 bytes
.../binaryTree/DiameterBinaryTree.class | Bin 0 -> 784 bytes
.../FlattenBinaryTreeToLinkedList.class | Bin 0 -> 1393 bytes
.../classes/binaryTree/InorderTraversal.class | Bin 0 -> 1382 bytes
.../classes/binaryTree/InvertBinaryTree.class | Bin 0 -> 711 bytes
.../binaryTree/LevelOrderTraversal.class | Bin 0 -> 1595 bytes
.../classes/binaryTree/MaximumDepth.class | Bin 0 -> 450 bytes
.../binaryTree/MaximumDepthNTree.class | Bin 0 -> 298 bytes
.../binaryTree/MinimumDepthBinaryTree.class | Bin 0 -> 786 bytes
.../target/classes/binaryTree/SameTree.class | Bin 0 -> 652 bytes
.../target/classes/binaryTree/SameTree2.class | Bin 0 -> 775 bytes
.../SerializeAndDeserializeBinaryTree.class | Bin 0 -> 2386 bytes
.../target/classes/binaryTree/TreeNode.class | Bin 0 -> 2304 bytes
.../ZigzagLevelOrderTraversal.class | Bin 0 -> 1733 bytes
.../InsertDeleteGetRandom.class | Bin 0 -> 1166 bytes
.../dataStructureDesign/LFUCache.class | Bin 0 -> 2570 bytes
.../classes/dataStructureDesign/LFUNode.class | Bin 0 -> 552 bytes
.../dataStructureDesign/LRUCache.class | Bin 0 -> 1340 bytes
.../dataStructureDesign/LRUCache2.class | Bin 0 -> 1619 bytes
.../MaximumFrequencyStack.class | Bin 0 -> 1686 bytes
.../dataStructureDesign/MinStack.class | Bin 0 -> 1219 bytes
.../classes/dataStructureDesign/Node.class | Bin 0 -> 398 bytes
.../classes/differenceArray/CarPooling.class | Bin 0 -> 775 bytes
.../differenceArray/FlightBooking.class | Bin 0 -> 717 bytes
.../classes/differenceArray/RangeAdd.class | Bin 0 -> 704 bytes
.../classes/graphTheory/AllPathList.class | Bin 0 -> 1495 bytes
.../doublePointer/AddTwoNumbers.class | Bin 0 -> 1018 bytes
.../doublePointer/AddTwoNumbers2.class | Bin 0 -> 1574 bytes
.../doublePointer/DeleteNthNode.class | Bin 0 -> 800 bytes
.../doublePointer/LinkedListCycle.class | Bin 0 -> 745 bytes
.../doublePointer/LinkedListCycleII.class | Bin 0 -> 772 bytes
.../doublePointer/LinkedListIntersect.class | Bin 0 -> 784 bytes
.../linkedList/doublePointer/ListNode.class | Bin 0 -> 1205 bytes
.../doublePointer/MergeKSortedList.class | Bin 0 -> 2032 bytes
.../doublePointer/MergeSortedList.class | Bin 0 -> 981 bytes
.../linkedList/doublePointer/MiddleNode.class | Bin 0 -> 695 bytes
.../doublePointer/PalindromeLinkedList.class | Bin 0 -> 335 bytes
.../doublePointer/RemoveDuplicate.class | Bin 0 -> 726 bytes
.../doublePointer/ReverseLinkedListII.class | Bin 0 -> 332 bytes
.../doublePointer/ReverseNodesInKGroup.class | Bin 0 -> 629 bytes
.../target/classes/multiThread/FizzBuzz.class | Bin 0 -> 3076 bytes
.../classes/multiThread/FizzBuzzII$1.class | Bin 0 -> 662 bytes
.../classes/multiThread/FizzBuzzII$2.class | Bin 0 -> 662 bytes
.../classes/multiThread/FizzBuzzII$3.class | Bin 0 -> 666 bytes
.../classes/multiThread/FizzBuzzII.class | Bin 0 -> 3768 bytes
.../classes/multiThread/FizzBuzzIII.class | Bin 0 -> 3653 bytes
.../classes/multiThread/IntConsumer.class | Bin 0 -> 488 bytes
.../PrintFooBarAlternately$1.class | Bin 0 -> 821 bytes
.../PrintFooBarAlternately$2.class | Bin 0 -> 821 bytes
.../multiThread/PrintFooBarAlternately.class | Bin 0 -> 2731 bytes
.../classes/multiThread/PrintInOrder$1.class | Bin 0 -> 765 bytes
.../classes/multiThread/PrintInOrder$2.class | Bin 0 -> 767 bytes
.../classes/multiThread/PrintInOrder$3.class | Bin 0 -> 765 bytes
.../classes/multiThread/PrintInOrder.class | Bin 0 -> 3309 bytes
.../classes/multiThread/PrintInOrder2$1.class | Bin 0 -> 771 bytes
.../classes/multiThread/PrintInOrder2$2.class | Bin 0 -> 773 bytes
.../classes/multiThread/PrintInOrder2$3.class | Bin 0 -> 771 bytes
.../classes/multiThread/PrintInOrder2.class | Bin 0 -> 3308 bytes
.../classes/multiThread/PrintInOrder3$1.class | Bin 0 -> 771 bytes
.../classes/multiThread/PrintInOrder3$2.class | Bin 0 -> 773 bytes
.../classes/multiThread/PrintInOrder3$3.class | Bin 0 -> 771 bytes
.../classes/multiThread/PrintInOrder3.class | Bin 0 -> 3246 bytes
.../multiThread/PrintZeroOddEven.class | Bin 0 -> 2511 bytes
.../classes/multiThread/ProduceH2O.class | Bin 0 -> 945 bytes
algorithm/target/classes/nSum/NSum.class | Bin 0 -> 1881 bytes
algorithm/target/classes/nSum/ThreeSum.class | Bin 0 -> 1828 bytes
algorithm/target/classes/nSum/TwoSum.class | Bin 0 -> 2094 bytes
algorithm/target/classes/offer/Divide.class | Bin 0 -> 255 bytes
.../target/classes/other/IsIsomorphic.class | Bin 0 -> 1439 bytes
.../target/classes/prefixSum/MatrixSum.class | Bin 0 -> 967 bytes
.../target/classes/prefixSum/NumArray.class | Bin 0 -> 621 bytes
.../target/classes/prefixSum/NumMatrix.class | Bin 0 -> 726 bytes
.../classes/prefixSum/ProductOfNumbers.class | Bin 0 -> 1172 bytes
.../target/classes/stack_queue/EvalRPN.class | Bin 0 -> 1418 bytes
.../ImplementQueueUsingStacks.class | Bin 0 -> 1382 bytes
.../ImplementStackUsingQueues.class | Bin 0 -> 1294 bytes
.../stack_queue/LongestValidParentheses.class | Bin 0 -> 1331 bytes
.../classes/stack_queue/MinAddMakeValid.class | Bin 0 -> 710 bytes
.../target/classes/stack_queue/MinStack.class | Bin 0 -> 1216 bytes
...inimumInsertionsToBalanceParentheses.class | Bin 0 -> 794 bytes
.../classes/stack_queue/MonotonicQueue.class | Bin 0 -> 1085 bytes
.../classes/stack_queue/SimplifyPath.class | Bin 0 -> 1381 bytes
.../stack_queue/SlidingWindowMax.class | Bin 0 -> 851 bytes
.../stack_queue/ValidParentheses.class | Bin 0 -> 1199 bytes
.../BinaryTreeLevelOrderTraversalIITest.class | Bin 0 -> 1532 bytes
.../BinaryTreeLevelOrderTraversalTest.class | Bin 0 -> 1521 bytes
...aryTreeZigzagLevelOrderTraversalTest.class | Bin 0 -> 2085 bytes
.../BSF_DSF/CountSubIslandsTest.class | Bin 0 -> 1466 bytes
.../BSF_DSF/MaxAreaIslandTest.class | Bin 0 -> 1450 bytes
.../BSF_DSF/MinimumDepthBinaryTreeTest.class | Bin 0 -> 977 bytes
.../BSF_DSF/NumberClosedIslandsTest.class | Bin 0 -> 992 bytes
.../BSF_DSF/NumberDistinctIslandsTest.class | Bin 0 -> 1179 bytes
.../BSF_DSF/NumberEnclavesTest.class | Bin 0 -> 845 bytes
.../BSF_DSF/NumberIslandsTest.class | Bin 0 -> 1131 bytes
.../BSF_DSF/OpenTheLockTest.class | Bin 0 -> 1460 bytes
.../BSF_DSF/SlidingPuzzleTest.class | Bin 0 -> 1125 bytes
.../BSF_DSF/SurroundedRegionsTest.class | Bin 0 -> 963 bytes
.../test-classes/DP/BloodSimilarityTest.class | Bin 0 -> 825 bytes
.../test-classes/DP/DisjointLinesTest.class | Bin 0 -> 1174 bytes
.../target/test-classes/DP/EnvelopsTest.class | Bin 0 -> 267 bytes
.../test-classes/DP/IsSubsequenceTest.class | Bin 0 -> 966 bytes
.../DP/LongestCommonSubsequenceIITest.class | Bin 0 -> 1208 bytes
.../DP/LongestCommonSubsequenceTest.class | Bin 0 -> 1198 bytes
.../DP/MinFallingPathSum2Test.class | Bin 0 -> 1248 bytes
.../DP/MinFallingPathSumIITest.class | Bin 0 -> 1371 bytes
.../DP/MinFallingPathSumTest.class | Bin 0 -> 1361 bytes
.../test-classes/DP/MinPathSumTest.class | Bin 0 -> 936 bytes
.../DP/MinimumTriangleTotalIITest.class | Bin 0 -> 1857 bytes
.../DP/MinimumTriangleTotalTest.class | Bin 0 -> 1847 bytes
.../test-classes/DP/PalindromeListTest.class | Bin 0 -> 1657 bytes
.../test-classes/DP/ReverseNode2Test.class | Bin 0 -> 1493 bytes
.../test-classes/DP/ReverseNode3Test.class | Bin 0 -> 1500 bytes
.../DP/ReverseNodeKGroupTest.class | Bin 0 -> 1301 bytes
.../test-classes/DP/ReverseNodeTest.class | Bin 0 -> 1192 bytes
.../DP/RussianDollEnvelopesTest.class | Bin 0 -> 303 bytes
.../DP/UniquePathsWithObstaclesTest.class | Bin 0 -> 1167 bytes
algorithm/target/test-classes/JavaStudy.class | Bin 0 -> 370 bytes
.../alibaba/DuplicateLengthTest.class | Bin 0 -> 1216 bytes
.../array/binarySearch/EatBananaTest.class | Bin 0 -> 1127 bytes
.../binarySearch/IsSubsequenceTest.class | Bin 0 -> 1030 bytes
.../array/binarySearch/PeakArrayTest.class | Bin 0 -> 1035 bytes
.../binarySearch/PreimageSizeZFTest.class | Bin 0 -> 1244 bytes
.../SearchInsertPositionTest.class | Bin 0 -> 1354 bytes
.../array/binarySearch/SearchMatrixTest.class | Bin 0 -> 1772 bytes
.../binarySearch/SearchPositionTest.class | Bin 0 -> 1069 bytes
.../array/binarySearch/SearchRangeTest.class | Bin 0 -> 1029 bytes
.../binarySearch/ShipWithinDaysTest.class | Bin 0 -> 1144 bytes
.../array/binarySearch/TailingZerosTest.class | Bin 0 -> 966 bytes
.../array/other/AdvantageShuffleTest.class | Bin 0 -> 1119 bytes
.../other/ContainerWithMostWaterTest.class | Bin 0 -> 854 bytes
.../other/IntervalListIntersectionsTest.class | Bin 0 -> 1502 bytes
.../array/other/MaxRepeatSubStringTest.class | Bin 0 -> 909 bytes
.../RemoveDuplicateSortedArrayTest.class | Bin 0 -> 931 bytes
.../array/other/Search2DMatrixIITest.class | Bin 0 -> 1266 bytes
.../array/other/SquaresSortedArrayTest.class | Bin 0 -> 893 bytes
.../array/other/TrappingRainWaterTest.class | Bin 0 -> 991 bytes
.../array/other/TwoSumLessThanKTest.class | Bin 0 -> 997 bytes
.../array/slideWIndow/FindAnagramsTest.class | Bin 0 -> 1637 bytes
.../LengthOfLongestSubstringTest.class | Bin 0 -> 1132 bytes
.../slideWIndow/MinWindowSubstringTest.class | Bin 0 -> 1251 bytes
.../array/slideWIndow/MinimumWindowTest.class | Bin 0 -> 1015 bytes
.../array/slideWIndow/PermutationTest.class | Bin 0 -> 802 bytes
.../SlidingWindowMaximumTest.class | Bin 0 -> 836 bytes
.../backTrack/CombinationSumTest.class | Bin 0 -> 1577 bytes
.../backTrack/CombinationsTest.class | Bin 0 -> 1249 bytes
.../backTrack/GenerateParenthesesTest.class | Bin 0 -> 1189 bytes
.../MaximumDepthBinaryTreeTest.class | Bin 0 -> 323 bytes
.../test-classes/backTrack/NQueuesTest.class | Bin 0 -> 1284 bytes
.../PartitionKEqualSumSubsetsTest.class | Bin 0 -> 1040 bytes
.../backTrack/PermutationsTest.class | Bin 0 -> 1237 bytes
.../test-classes/backTrack/SubsetsTest.class | Bin 0 -> 1207 bytes
.../backTrack/SudokuSolverTest.class | Bin 0 -> 1537 bytes
.../backTrack/TargetSum2Test.class | Bin 0 -> 751 bytes
.../backTrack/TargetSumTest.class | Bin 0 -> 746 bytes
.../binaryHeap/KthLargestDataTest.class | Bin 0 -> 1019 bytes
.../binaryHeap/KthLargestElementTest.class | Bin 0 -> 782 bytes
.../binaryHeap/LRUCacheTest.class | Bin 0 -> 283 bytes
.../binaryHeap/MaxFrequencyTest.class | Bin 0 -> 295 bytes
.../binaryHeap/MedianDataTest.class | Bin 0 -> 757 bytes
.../binaryHeap/MergeSortedListsTest.class | Bin 0 -> 307 bytes
.../binaryHeap/MinStackTest.class | Bin 0 -> 813 bytes
.../binaryHeap/SeatReserveTest.class | Bin 0 -> 869 bytes
.../binaryHeap/SingleThreadCPUTest.class | Bin 0 -> 1059 bytes
.../BinaryTreeLevelOrderTraversalTest.class | Bin 0 -> 1533 bytes
.../BinaryTreePostorderTraversalTest.class | Bin 0 -> 343 bytes
...aryTreeZigzagLevelOrderTraversalTest.class | Bin 0 -> 1551 bytes
.../binaryTree/DiameterBinaryTreeTest.class | Bin 0 -> 961 bytes
.../FlattenBinaryTreeToLinkedListTest.class | Bin 0 -> 1690 bytes
.../binaryTree/InorderTraversalTest.class | Bin 0 -> 543 bytes
.../test-classes/binaryTree/IntegerTest.class | Bin 0 -> 792 bytes
.../binaryTree/InvertBinaryTreeTest.class | Bin 0 -> 1161 bytes
.../binaryTree/MaximumDepthNTreeTest.class | Bin 0 -> 310 bytes
.../MinimumDepthBinaryTreeTest.class | Bin 0 -> 989 bytes
.../binaryTree/SameTree2Test.class | Bin 0 -> 973 bytes
...erializeAndDeserializeBinaryTreeTest.class | Bin 0 -> 1383 bytes
.../FlattenNestedListIterator.class | Bin 0 -> 1537 bytes
.../InsertDeleteGetRandomTest.class | Bin 0 -> 934 bytes
.../dataStructureDesign/LFUCacheTest.class | Bin 0 -> 868 bytes
.../dataStructureDesign/LRUCache2Test.class | Bin 0 -> 1076 bytes
.../dataStructureDesign/LRUCacheTest.class | Bin 0 -> 1071 bytes
.../dataStructureDesign/NestedInteger.class | Bin 0 -> 1316 bytes
.../differenceArray/CarPoolingTest.class | Bin 0 -> 924 bytes
.../differenceArray/FlightBookingTest.class | Bin 0 -> 812 bytes
.../differenceArray/RangeAddTest.class | Bin 0 -> 771 bytes
.../graphTherory/AllPathListTest.class | Bin 0 -> 296 bytes
.../doublePointer/AddTwoNumbers2Test.class | Bin 0 -> 2309 bytes
.../doublePointer/AddTwoNumbersTest.class | Bin 0 -> 2304 bytes
.../doublePointer/DeleteNthNodeTest.class | Bin 0 -> 1332 bytes
.../doublePointer/LinkedListCycleIITest.class | Bin 0 -> 1542 bytes
.../doublePointer/LinkedListCycleTest.class | Bin 0 -> 1547 bytes
.../LinkedListIntersectTest.class | Bin 0 -> 344 bytes
.../doublePointer/MergeKSortedListTest.class | Bin 0 -> 1564 bytes
.../doublePointer/MergeSortedListTest.class | Bin 0 -> 1661 bytes
.../doublePointer/MiddleNodeTest.class | Bin 0 -> 1307 bytes
.../doublePointer/RemoveDuplicateTest.class | Bin 0 -> 1494 bytes
.../target/test-classes/nSum/NSumTest.class | Bin 0 -> 2380 bytes
.../test-classes/nSum/ThreeSumTest.class | Bin 0 -> 1793 bytes
.../target/test-classes/nSum/TwoSumTest.class | Bin 0 -> 1760 bytes
.../test-classes/offer/DivideTest.class | Bin 0 -> 267 bytes
.../test-classes/other/IsIsomorphicTest.class | Bin 0 -> 984 bytes
.../prefixSum/MatrixSumTest.class | Bin 0 -> 861 bytes
.../test-classes/prefixSum/NumArrayTest.class | Bin 0 -> 747 bytes
.../prefixSum/NumMatrixTest.class | Bin 0 -> 1097 bytes
.../prefixSum/ProductOfNumbersTest.class | Bin 0 -> 866 bytes
.../stack_queue/EvalRPNTest.class | Bin 0 -> 1232 bytes
.../ImplementQueueUsingStacksTest.class | Bin 0 -> 904 bytes
.../ImplementStackUsingQueuesTest.class | Bin 0 -> 904 bytes
.../LongestValidParenthesesTest.class | Bin 0 -> 1313 bytes
.../stack_queue/MinAddMakeValidTest.class | Bin 0 -> 1102 bytes
.../stack_queue/MinStackTest.class | Bin 0 -> 769 bytes
...umInsertionsToBalanceParenthesesTest.class | Bin 0 -> 1223 bytes
.../stack_queue/QueueTest$QueueNode.class | Bin 0 -> 515 bytes
.../test-classes/stack_queue/QueueTest.class | Bin 0 -> 2416 bytes
.../stack_queue/SimplifyPathTest.class | Bin 0 -> 1425 bytes
.../stack_queue/SlidingWindowMaxTest.class | Bin 0 -> 832 bytes
.../stack_queue/ValidParenthesesTest.class | Bin 0 -> 1255 bytes
.../target/classes/AreNumbersAscending.class | Bin 0 -> 1041 bytes
.../target/classes/ArrayStringsAreEqual.class | Bin 0 -> 830 bytes
.../classes/ArrayStringsAreEqualRedoI.class | Bin 0 -> 879 bytes
leetcode/target/classes/BuildTree.class | Bin 0 -> 1469 bytes
leetcode/target/classes/CanJump.class | Bin 0 -> 542 bytes
leetcode/target/classes/CheckInclusion.class | Bin 0 -> 1767 bytes
.../target/classes/CheckOnesSegment.class | Bin 0 -> 1148 bytes
leetcode/target/classes/CombinationSum.class | Bin 0 -> 1501 bytes
leetcode/target/classes/CombinationSum2.class | Bin 0 -> 1594 bytes
leetcode/target/classes/Combine.class | Bin 0 -> 1398 bytes
leetcode/target/classes/CommonChars.class | Bin 0 -> 2293 bytes
leetcode/target/classes/CountPrimes.class | Bin 0 -> 728 bytes
leetcode/target/classes/CuttingRope.class | Bin 0 -> 555 bytes
leetcode/target/classes/CuttingRopeII.class | Bin 0 -> 699 bytes
leetcode/target/classes/DecodeString.class | Bin 0 -> 547 bytes
leetcode/target/classes/DeleteAndEarn.class | Bin 0 -> 1013 bytes
.../target/classes/DeleteDuplicates.class | Bin 0 -> 679 bytes
.../target/classes/DeleteDuplicatesII.class | Bin 0 -> 749 bytes
leetcode/target/classes/Divide.class | Bin 0 -> 385 bytes
leetcode/target/classes/Exist.class | Bin 0 -> 1148 bytes
leetcode/target/classes/Expand.class | Bin 0 -> 3673 bytes
leetcode/target/classes/FindDuplicate.class | Bin 0 -> 539 bytes
.../classes/FindMedianSortedArrays.class | Bin 0 -> 848 bytes
.../classes/FindMedianSortedArraysII.class | Bin 0 -> 798 bytes
.../classes/FindMedianSortedArraysIII.class | Bin 0 -> 900 bytes
leetcode/target/classes/FindMin.class | Bin 0 -> 633 bytes
leetcode/target/classes/FindPeakElement.class | Bin 0 -> 537 bytes
.../target/classes/FirstMissingPositive.class | Bin 0 -> 647 bytes
leetcode/target/classes/FourSum.class | Bin 0 -> 699 bytes
leetcode/target/classes/FullJustify.class | Bin 0 -> 1300 bytes
.../target/classes/GenerateParenthesis.class | Bin 0 -> 1428 bytes
leetcode/target/classes/GroupAnagrams.class | Bin 0 -> 1659 bytes
leetcode/target/classes/HIndexII.class | Bin 0 -> 540 bytes
leetcode/target/classes/HammingWeight.class | Bin 0 -> 481 bytes
leetcode/target/classes/InsertInterval.class | Bin 0 -> 1241 bytes
leetcode/target/classes/IntToRoman.class | Bin 0 -> 1875 bytes
leetcode/target/classes/IntegerReverse.class | Bin 0 -> 570 bytes
leetcode/target/classes/IsInterleave.class | Bin 0 -> 1092 bytes
leetcode/target/classes/IsMatch.class | Bin 0 -> 878 bytes
leetcode/target/classes/IsNumber$1.class | Bin 0 -> 783 bytes
leetcode/target/classes/IsNumber$2.class | Bin 0 -> 755 bytes
leetcode/target/classes/IsNumber$3.class | Bin 0 -> 784 bytes
leetcode/target/classes/IsNumber$4.class | Bin 0 -> 770 bytes
leetcode/target/classes/IsNumber$5.class | Bin 0 -> 741 bytes
leetcode/target/classes/IsNumber$6.class | Bin 0 -> 757 bytes
leetcode/target/classes/IsNumber$7.class | Bin 0 -> 742 bytes
leetcode/target/classes/IsNumber$8.class | Bin 0 -> 757 bytes
leetcode/target/classes/IsNumber$9.class | Bin 0 -> 742 bytes
leetcode/target/classes/IsNumber.class | Bin 0 -> 1569 bytes
leetcode/target/classes/IsSubstructure.class | Bin 0 -> 1182 bytes
leetcode/target/classes/Jump.class | Bin 0 -> 569 bytes
leetcode/target/classes/LengthOfLIS.class | Bin 0 -> 940 bytes
.../target/classes/LengthOfLastWord.class | Bin 0 -> 634 bytes
.../classes/LetterCasePermutation.class | Bin 0 -> 1270 bytes
.../target/classes/LetterCombinations.class | Bin 0 -> 2113 bytes
leetcode/target/classes/ListNode.class | Bin 0 -> 1597 bytes
.../target/classes/LongestPalindrome.class | Bin 0 -> 1336 bytes
.../classes/LongestValidParentheses.class | Bin 0 -> 1028 bytes
.../classes/LongestValidParenthesesII.class | Bin 0 -> 1188 bytes
.../classes/META-INF/leetcode.kotlin_module | Bin 0 -> 16 bytes
leetcode/target/classes/MaxArea.class | Bin 0 -> 578 bytes
leetcode/target/classes/MaxPoints.class | Bin 0 -> 382 bytes
leetcode/target/classes/MaxSubArray.class | Bin 0 -> 678 bytes
leetcode/target/classes/MaxSubArrayII.class | Bin 0 -> 919 bytes
.../classes/MaxSubarraySumCircular.class | Bin 0 -> 1372 bytes
.../classes/MaxSubarraySumCircularII.class | Bin 0 -> 826 bytes
leetcode/target/classes/MergeIntervals.class | Bin 0 -> 2420 bytes
.../target/classes/MergeIntervalsII.class | Bin 0 -> 1814 bytes
leetcode/target/classes/MergeKLists.class | Bin 0 -> 1733 bytes
leetcode/target/classes/MergeTwoLists.class | Bin 0 -> 1788 bytes
leetcode/target/classes/MiddleNode.class | Bin 0 -> 534 bytes
leetcode/target/classes/MinArea.class | Bin 0 -> 859 bytes
leetcode/target/classes/MinMeetingRooms.class | Bin 0 -> 1172 bytes
leetcode/target/classes/Multiply.class | Bin 0 -> 1185 bytes
leetcode/target/classes/MyAtoi.class | Bin 0 -> 917 bytes
leetcode/target/classes/MyPow.class | Bin 0 -> 569 bytes
leetcode/target/classes/MySqrt.class | Bin 0 -> 568 bytes
leetcode/target/classes/NQueens.class | Bin 0 -> 2205 bytes
leetcode/target/classes/NQueens2.class | Bin 0 -> 1529 bytes
leetcode/target/classes/Node.class | Bin 0 -> 1257 bytes
.../target/classes/NumMatchingSubseq.class | Bin 0 -> 1731 bytes
.../target/classes/OrderCycleLinkedList.class | Bin 0 -> 507 bytes
leetcode/target/classes/Partition.class | Bin 0 -> 1039 bytes
leetcode/target/classes/ReadBinaryWatch.class | Bin 0 -> 1583 bytes
leetcode/target/classes/RecordSpaces.class | Bin 0 -> 1667 bytes
.../target/classes/RemoveDuplicates.class | Bin 0 -> 520 bytes
.../classes/RemoveZeroSumSublists.class | Bin 0 -> 1140 bytes
leetcode/target/classes/ReorderList.class | Bin 0 -> 1087 bytes
leetcode/target/classes/ReorderListII.class | Bin 0 -> 1213 bytes
leetcode/target/classes/ReverseBits.class | Bin 0 -> 480 bytes
.../target/classes/ReverseLeftWords.class | Bin 0 -> 704 bytes
leetcode/target/classes/ReverseList.class | Bin 0 -> 623 bytes
leetcode/target/classes/ReverseWords.class | Bin 0 -> 1009 bytes
leetcode/target/classes/ReverseWords2.class | Bin 0 -> 519 bytes
leetcode/target/classes/Rob.class | Bin 0 -> 719 bytes
leetcode/target/classes/Rob2.class | Bin 0 -> 784 bytes
leetcode/target/classes/Search.class | Bin 0 -> 637 bytes
leetcode/target/classes/SearchII.class | Bin 0 -> 718 bytes
leetcode/target/classes/SearchMatrixII.class | Bin 0 -> 605 bytes
leetcode/target/classes/SearchRange.class | Bin 0 -> 720 bytes
leetcode/target/classes/SimplifyPath.class | Bin 0 -> 550 bytes
leetcode/target/classes/SortColors.class | Bin 0 -> 562 bytes
leetcode/target/classes/SpiralOrder.class | Bin 0 -> 951 bytes
.../target/classes/SplitIntoFibonacci.class | Bin 0 -> 674 bytes
leetcode/target/classes/StrStr.class | Bin 0 -> 1962 bytes
leetcode/target/classes/Subsets.class | Bin 0 -> 1383 bytes
leetcode/target/classes/SubsetsWithDup.class | Bin 0 -> 1498 bytes
leetcode/target/classes/SwapPairs.class | Bin 0 -> 621 bytes
leetcode/target/classes/ThreeSum.class | Bin 0 -> 1090 bytes
leetcode/target/classes/ThreeSumClosest.class | Bin 0 -> 795 bytes
leetcode/target/classes/ThreeSumSmaller.class | Bin 0 -> 740 bytes
leetcode/target/classes/Trap.class | Bin 0 -> 761 bytes
leetcode/target/classes/TreeNode.class | Bin 0 -> 1735 bytes
.../classes/ValidateStackSequences.class | Bin 0 -> 1036 bytes
leetcode/target/classes/ZigZagConvert.class | Bin 0 -> 1568 bytes
.../AreNumbersAscendingTest.class | Bin 0 -> 1322 bytes
.../ArrayStringsAreEqualRedoITest.class | Bin 0 -> 1316 bytes
.../ArrayStringsAreEqualTest.class | Bin 0 -> 1291 bytes
.../target/test-classes/CanJumpTest.class | Bin 0 -> 839 bytes
.../test-classes/CheckInclusionTest.class | Bin 0 -> 964 bytes
.../test-classes/CheckOnesSegmentTest.class | Bin 0 -> 899 bytes
.../test-classes/CombinationSum2Test.class | Bin 0 -> 1529 bytes
.../test-classes/CombinationSumTest.class | Bin 0 -> 1762 bytes
.../target/test-classes/CombineTest.class | Bin 0 -> 1402 bytes
.../target/test-classes/CommonCharsTest.class | Bin 0 -> 1123 bytes
.../target/test-classes/CountPrimesTest.class | Bin 0 -> 811 bytes
.../test-classes/CuttingRopeIITest.class | Bin 0 -> 1064 bytes
.../target/test-classes/CuttingRopeTest.class | Bin 0 -> 926 bytes
.../test-classes/DecodeStringTest.class | Bin 0 -> 773 bytes
.../test-classes/DeleteAndEarnTest.class | Bin 0 -> 1030 bytes
.../test-classes/DeleteDuplicatesIITest.class | Bin 0 -> 1278 bytes
.../test-classes/DeleteDuplicatesTest.class | Bin 0 -> 1250 bytes
leetcode/target/test-classes/DivideTest.class | Bin 0 -> 689 bytes
leetcode/target/test-classes/ExistTest.class | Bin 0 -> 1681 bytes
leetcode/target/test-classes/ExpandTest.class | Bin 0 -> 1141 bytes
.../test-classes/FindDuplicateTest.class | Bin 0 -> 875 bytes
.../FindMedianSortedArraysIIITest.class | Bin 0 -> 1477 bytes
.../FindMedianSortedArraysIITest.class | Bin 0 -> 976 bytes
.../FindMedianSortedArraysTest.class | Bin 0 -> 966 bytes
.../target/test-classes/FindMinTest.class | Bin 0 -> 835 bytes
.../test-classes/FindPeakElementTest.class | Bin 0 -> 734 bytes
.../FirstMissingPositiveTest.class | Bin 0 -> 1059 bytes
.../target/test-classes/FourSumTest.class | Bin 0 -> 1196 bytes
.../target/test-classes/FullJustifyTest.class | Bin 0 -> 1029 bytes
.../GenerateParenthesisTest.class | Bin 0 -> 1009 bytes
.../test-classes/GroupAnagramsTest.class | Bin 0 -> 2471 bytes
.../target/test-classes/HIndexIITest.class | Bin 0 -> 1109 bytes
.../test-classes/HammingWeightTest.class | Bin 0 -> 953 bytes
.../test-classes/InsertIntervalTest.class | Bin 0 -> 1817 bytes
.../target/test-classes/IntToRomanTest.class | Bin 0 -> 1246 bytes
.../test-classes/IntegerReverseTest.class | Bin 0 -> 1517 bytes
.../test-classes/IsInterleaveTest.class | Bin 0 -> 1789 bytes
.../target/test-classes/IsMatchTest.class | Bin 0 -> 1414 bytes
.../target/test-classes/IsNumberTest.class | Bin 0 -> 851 bytes
.../test-classes/IsSubstructureTest.class | Bin 0 -> 1394 bytes
leetcode/target/test-classes/JumpTest.class | Bin 0 -> 958 bytes
.../test-classes/LengthOfLastWordTest.class | Bin 0 -> 285 bytes
.../LetterCasePermutationTest.class | Bin 0 -> 1134 bytes
.../test-classes/LetterCombinationsTest.class | Bin 0 -> 1211 bytes
.../test-classes/LongestOfLISTest.class | Bin 0 -> 911 bytes
.../test-classes/LongestPalindromeTest.class | Bin 0 -> 805 bytes
.../LongestValidParenthesesIITest.class | Bin 0 -> 1226 bytes
.../LongestValidParenthesesTest.class | Bin 0 -> 1216 bytes
.../META-INF/leetcode.kotlin_module | Bin 0 -> 16 bytes
.../target/test-classes/MaxAreaTest.class | Bin 0 -> 716 bytes
.../target/test-classes/MaxPointsTest.class | Bin 0 -> 737 bytes
.../test-classes/MaxSubArrayIITest.class | Bin 0 -> 1164 bytes
.../target/test-classes/MaxSubArrayTest.class | Bin 0 -> 1154 bytes
.../MaxSubarraySumCircularIITest.class | Bin 0 -> 1210 bytes
.../MaxSubarraySumCircularTest.class | Bin 0 -> 1200 bytes
.../test-classes/MergeIntervalsIITest.class | Bin 0 -> 1461 bytes
.../test-classes/MergeIntervalsTest.class | Bin 0 -> 1451 bytes
.../target/test-classes/MergeKListsTest.class | Bin 0 -> 270 bytes
.../test-classes/MergeTwoListsTest.class | Bin 0 -> 907 bytes
.../target/test-classes/MinAreaTest.class | Bin 0 -> 975 bytes
.../test-classes/MinMeetingRoomsTest.class | Bin 0 -> 780 bytes
.../target/test-classes/MultiplyTest.class | Bin 0 -> 1476 bytes
leetcode/target/test-classes/MyAtoiTest.class | Bin 0 -> 989 bytes
leetcode/target/test-classes/MyPowTest.class | Bin 0 -> 1224 bytes
leetcode/target/test-classes/MySqrtTest.class | Bin 0 -> 1103 bytes
.../target/test-classes/NQueens2Test.class | Bin 0 -> 796 bytes
.../target/test-classes/NQueensTest.class | Bin 0 -> 1341 bytes
.../test-classes/NumMatchingSubseqTest.class | Bin 0 -> 1150 bytes
.../OrderCycleLinkedListTest.class | Bin 0 -> 1224 bytes
.../target/test-classes/PartitionTest.class | Bin 0 -> 1097 bytes
.../test-classes/ReadBinaryWatchTest.class | Bin 0 -> 1136 bytes
.../test-classes/RecordSpacesTest.class | Bin 0 -> 1403 bytes
.../test-classes/RemoveDuplicatesTest.class | Bin 0 -> 285 bytes
.../RemoveZeroSumSublistsTest.class | Bin 0 -> 1498 bytes
.../test-classes/ReorderListIITest.class | Bin 0 -> 994 bytes
.../target/test-classes/ReorderListTest.class | Bin 0 -> 984 bytes
.../target/test-classes/ReverseBitsTest.class | Bin 0 -> 811 bytes
.../test-classes/ReverseLeftWordsTest.class | Bin 0 -> 983 bytes
.../target/test-classes/ReverseListTest.class | Bin 0 -> 870 bytes
.../test-classes/ReverseWords2Test.class | Bin 0 -> 1243 bytes
.../test-classes/ReverseWordsTest.class | Bin 0 -> 1078 bytes
leetcode/target/test-classes/Rob2Test.class | Bin 0 -> 1082 bytes
leetcode/target/test-classes/RobTest.class | Bin 0 -> 813 bytes
.../target/test-classes/SearchIITest.class | Bin 0 -> 737 bytes
.../test-classes/SearchMatrixIITest.class | Bin 0 -> 1211 bytes
.../target/test-classes/SearchRangeTest.class | Bin 0 -> 1323 bytes
leetcode/target/test-classes/SearchTest.class | Bin 0 -> 1051 bytes
.../test-classes/SimplifyPathTest.class | Bin 0 -> 1205 bytes
.../target/test-classes/SortColorsTest.class | Bin 0 -> 901 bytes
.../target/test-classes/SpiralOrderTest.class | Bin 0 -> 1291 bytes
.../test-classes/SplitIntoFibonacciTest.class | Bin 0 -> 1910 bytes
leetcode/target/test-classes/StrStrTest.class | Bin 0 -> 931 bytes
.../target/test-classes/SubsetsTest.class | Bin 0 -> 1370 bytes
.../test-classes/SubsetsWithDupTest.class | Bin 0 -> 1412 bytes
.../target/test-classes/SwapPairsTest.class | Bin 0 -> 264 bytes
.../test-classes/ThreeSumClosestTest.class | Bin 0 -> 920 bytes
.../test-classes/ThreeSumSmallerTest.class | Bin 0 -> 1221 bytes
.../target/test-classes/ThreeSumTest.class | Bin 0 -> 1639 bytes
leetcode/target/test-classes/TrapTest.class | Bin 0 -> 863 bytes
.../ValidateStackSequencesTest.class | Bin 0 -> 1192 bytes
.../test-classes/ZigZagConvertTest.class | Bin 0 -> 1256 bytes
offer/pom.xml | 20 +++
offer/src/main/java/AddBinary.java | 38 ++++++
offer/src/main/java/CheckInclusion.java | 51 ++++++++
offer/src/main/java/CheckInclusionII.java | 57 ++++++++
offer/src/main/java/CountBits.java | 25 ++++
offer/src/main/java/CountSubstrings.java | 41 ++++++
offer/src/main/java/DetectCycle.java | 27 ++++
offer/src/main/java/Divide.java | 16 +++
offer/src/main/java/FindAnagrams.java | 39 ++++++
offer/src/main/java/FindMaxLength.java | 36 +++++
offer/src/main/java/IntersectionNode.java | 25 ++++
offer/src/main/java/IsPalindrome.java | 35 +++++
.../main/java/LengthOfLongestSubstring.java | 30 +++++
offer/src/main/java/ListNode.java | 54 ++++++++
offer/src/main/java/MinSubArrayLength.java | 30 +++++
offer/src/main/java/MinWindow.java | 44 +++++++
offer/src/main/java/NumMatrix.java | 21 +++
.../java/NumSubArrayProductLessThanK.java | 32 +++++
offer/src/main/java/PivotIndex.java | 38 ++++++
offer/src/main/java/PivotIndexII.java | 27 ++++
offer/src/main/java/PivotIndexIII.java | 23 ++++
offer/src/main/java/RemoveNthFromEnd.java | 25 ++++
offer/src/main/java/RemoveNthFromEndII.java | 35 +++++
offer/src/main/java/SingleNumber.java | 22 ++++
offer/src/main/java/SubArraySum.java | 25 ++++
offer/src/main/java/ThreeSum.java | 59 +++++++++
offer/src/main/java/ThreeSumII.java | 80 ++++++++++++
offer/src/main/java/TwoIntegerDivide.java | 37 ++++++
offer/src/main/java/TwoIntegerDivide2.java | 50 +++++++
offer/src/main/java/TwoSum.java | 25 ++++
offer/src/main/java/ValidPalindrome.java | 31 +++++
offer/src/main/java/WordMaxProduct.java | 40 ++++++
offer/src/test/java/AddBinaryTest.java | 22 ++++
offer/src/test/java/CheckInclusionIITest.java | 51 ++++++++
offer/src/test/java/CheckInclusionTest.java | 33 +++++
offer/src/test/java/CountBitsTest.java | 21 +++
offer/src/test/java/CountSubstringsTest.java | 23 ++++
offer/src/test/java/DetectCycleTest.java | 27 ++++
offer/src/test/java/FindAnagramsTest.java | 26 ++++
offer/src/test/java/FindMaxLengthTest.java | 31 +++++
offer/src/test/java/IntersectionNodeTest.java | 31 +++++
offer/src/test/java/IsPalindromeTest.java | 30 +++++
.../java/LengthOfLongestSubstringTest.java | 37 ++++++
.../src/test/java/MinSubArrayLengthTest.java | 42 ++++++
offer/src/test/java/MinWindowTest.java | 50 +++++++
offer/src/test/java/NumMatrixTest.java | 34 +++++
.../java/NumSubArrayProductLessThanKTest.java | 32 +++++
offer/src/test/java/PivotIndexIIITest.java | 30 +++++
offer/src/test/java/PivotIndexIITest.java | 30 +++++
offer/src/test/java/PivotIndexTest.java | 30 +++++
.../src/test/java/RemoveNthFromEndIITest.java | 43 ++++++
offer/src/test/java/RemoveNthFromEndTest.java | 43 ++++++
offer/src/test/java/SingleNumberTest.java | 22 ++++
offer/src/test/java/StringBuilderTest.java | 19 +++
offer/src/test/java/SubArraySumTest.java | 24 ++++
offer/src/test/java/ThreeSumIITest.java | 44 +++++++
offer/src/test/java/ThreeSumTest.java | 44 +++++++
.../src/test/java/TwoIntegerDivide2Test.java | 54 ++++++++
offer/src/test/java/TwoIntegerDivideTest.java | 54 ++++++++
offer/src/test/java/TwoSumTes.java | 2 +
offer/src/test/java/ValidPalindromeTest.java | 46 +++++++
offer/src/test/java/WordMaxProductTest.java | 35 +++++
pom.xml | 54 ++++++++
880 files changed, 13148 insertions(+)
create mode 100644 algorithm/pom.xml
create mode 100644 algorithm/src/main/java/BFS_DFS/BinaryTreeLevelOrderTraversal.java
create mode 100644 algorithm/src/main/java/BFS_DFS/BinaryTreeLevelOrderTraversalII.java
create mode 100644 algorithm/src/main/java/BFS_DFS/BinaryTreeZigzagLevelOrderTraversal.java
create mode 100644 algorithm/src/main/java/BFS_DFS/CountSubIslands.java
create mode 100644 algorithm/src/main/java/BFS_DFS/MaxAreaIsland.java
create mode 100644 algorithm/src/main/java/BFS_DFS/MinimumDepthBinaryTree.java
create mode 100644 algorithm/src/main/java/BFS_DFS/NumberClosedIslands.java
create mode 100644 algorithm/src/main/java/BFS_DFS/NumberDistinctIslands.java
create mode 100644 algorithm/src/main/java/BFS_DFS/NumberEnclaves.java
create mode 100644 algorithm/src/main/java/BFS_DFS/NumberIslands.java
create mode 100644 algorithm/src/main/java/BFS_DFS/OpenTheLock.java
create mode 100644 algorithm/src/main/java/BFS_DFS/SlidingPuzzle.java
create mode 100644 algorithm/src/main/java/BFS_DFS/SurroundedRegions.java
create mode 100644 algorithm/src/main/java/DP/BloodSimilarity.java
create mode 100644 algorithm/src/main/java/DP/DisjointLines.java
create mode 100644 algorithm/src/main/java/DP/Envelops.java
create mode 100644 algorithm/src/main/java/DP/IsSubsequence.java
create mode 100644 algorithm/src/main/java/DP/LongestCommonSubsequence.java
create mode 100644 algorithm/src/main/java/DP/LongestCommonSubsequenceII.java
create mode 100644 algorithm/src/main/java/DP/MinFallingPathSum.java
create mode 100644 algorithm/src/main/java/DP/MinFallingPathSum2.java
create mode 100644 algorithm/src/main/java/DP/MinFallingPathSumII.java
create mode 100644 algorithm/src/main/java/DP/MinPathSum.java
create mode 100644 algorithm/src/main/java/DP/MinimumTriangleTotal.java
create mode 100644 algorithm/src/main/java/DP/MinimumTriangleTotalII.java
create mode 100644 algorithm/src/main/java/DP/PalindromeList.java
create mode 100644 algorithm/src/main/java/DP/ReverseNode.java
create mode 100644 algorithm/src/main/java/DP/ReverseNode2.java
create mode 100644 algorithm/src/main/java/DP/ReverseNode3.java
create mode 100644 algorithm/src/main/java/DP/ReverseNodeKGroup.java
create mode 100644 algorithm/src/main/java/DP/RussianDollEnvelopes.java
create mode 100644 algorithm/src/main/java/DP/UniquePathsWithObstacles.java
create mode 100644 algorithm/src/main/java/alibaba/DuplicateLength.java
create mode 100644 algorithm/src/main/java/alibaba/ThreadPrintABC.java
create mode 100644 algorithm/src/main/java/alibaba/ThreadPrintABC2.java
create mode 100644 algorithm/src/main/java/alibaba/ThreadPrintCharNum.java
create mode 100644 algorithm/src/main/java/alibaba/ThreadPrintNums.java
create mode 100644 algorithm/src/main/java/array/binarySearch/EatBanana.java
create mode 100644 algorithm/src/main/java/array/binarySearch/IsSubsequence.java
create mode 100644 algorithm/src/main/java/array/binarySearch/PeakArray.java
create mode 100644 algorithm/src/main/java/array/binarySearch/PreimageSizeZF.java
create mode 100644 algorithm/src/main/java/array/binarySearch/SearchInsertPosition.java
create mode 100644 algorithm/src/main/java/array/binarySearch/SearchMatrix.java
create mode 100644 algorithm/src/main/java/array/binarySearch/SearchPosition.java
create mode 100644 algorithm/src/main/java/array/binarySearch/SearchRange.java
create mode 100644 algorithm/src/main/java/array/binarySearch/ShipWithinDays.java
create mode 100644 algorithm/src/main/java/array/binarySearch/TailingZeros.java
create mode 100644 algorithm/src/main/java/array/other/AdvantageShuffle.java
create mode 100644 algorithm/src/main/java/array/other/ContainerWithMostWater.java
create mode 100644 algorithm/src/main/java/array/other/IntervalListIntersections.java
create mode 100644 algorithm/src/main/java/array/other/MaxRepeatSubString.java
create mode 100644 algorithm/src/main/java/array/other/RemoveDuplicateSortedArray.java
create mode 100644 algorithm/src/main/java/array/other/Search2DMatrixII.java
create mode 100644 algorithm/src/main/java/array/other/SquaresSortedArray.java
create mode 100644 algorithm/src/main/java/array/other/TrappingRainWater.java
create mode 100644 algorithm/src/main/java/array/other/TwoSumLessThanK.java
create mode 100644 algorithm/src/main/java/array/slideWindow/FindAnagrams.java
create mode 100644 algorithm/src/main/java/array/slideWindow/LengthOfLongestSubstring.java
create mode 100644 algorithm/src/main/java/array/slideWindow/MinWindowSubstring.java
create mode 100644 algorithm/src/main/java/array/slideWindow/MinimumWindow.java
create mode 100644 algorithm/src/main/java/array/slideWindow/Permutation.java
create mode 100644 algorithm/src/main/java/array/slideWindow/SlidingWindowMaximum.java
create mode 100644 algorithm/src/main/java/backTrack/CombinationSum.java
create mode 100644 algorithm/src/main/java/backTrack/Combinations.java
create mode 100644 algorithm/src/main/java/backTrack/GenerateParentheses.java
create mode 100644 algorithm/src/main/java/backTrack/MaximumDepthBinaryTree.java
create mode 100644 algorithm/src/main/java/backTrack/NQueues.java
create mode 100644 algorithm/src/main/java/backTrack/PartitionKEqualSumSubsets.java
create mode 100644 algorithm/src/main/java/backTrack/Permutations.java
create mode 100644 algorithm/src/main/java/backTrack/Subsets.java
create mode 100644 algorithm/src/main/java/backTrack/SudokuSolver.java
create mode 100644 algorithm/src/main/java/backTrack/TargetSum.java
create mode 100644 algorithm/src/main/java/backTrack/TargetSum2.java
create mode 100644 algorithm/src/main/java/binaryHeap/KthLargestData.java
create mode 100644 algorithm/src/main/java/binaryHeap/KthLargestElement.java
create mode 100644 algorithm/src/main/java/binaryHeap/MaxFrequency.java
create mode 100644 algorithm/src/main/java/binaryHeap/MedianData.java
create mode 100644 algorithm/src/main/java/binaryHeap/MinStack.java
create mode 100644 algorithm/src/main/java/binaryHeap/SeatReserve.java
create mode 100644 algorithm/src/main/java/binaryHeap/SingleThreadCPU.java
create mode 100644 algorithm/src/main/java/binaryTree/BinaryTreeLevelOrderTraversal.java
create mode 100644 algorithm/src/main/java/binaryTree/BinaryTreePostorderTraversal.java
create mode 100644 algorithm/src/main/java/binaryTree/BinaryTreeZigzagLevelOrderTraversal.java
create mode 100644 algorithm/src/main/java/binaryTree/DiameterBinaryTree.java
create mode 100644 algorithm/src/main/java/binaryTree/FlattenBinaryTreeToLinkedList.java
create mode 100644 algorithm/src/main/java/binaryTree/InorderTraversal.java
create mode 100644 algorithm/src/main/java/binaryTree/InvertBinaryTree.java
create mode 100644 algorithm/src/main/java/binaryTree/LevelOrderTraversal.java
create mode 100644 algorithm/src/main/java/binaryTree/MaximumDepth.java
create mode 100644 algorithm/src/main/java/binaryTree/MaximumDepthNTree.java
create mode 100644 algorithm/src/main/java/binaryTree/MinimumDepthBinaryTree.java
create mode 100644 algorithm/src/main/java/binaryTree/SameTree.java
create mode 100644 algorithm/src/main/java/binaryTree/SameTree2.java
create mode 100644 algorithm/src/main/java/binaryTree/SerializeAndDeserializeBinaryTree.java
create mode 100644 algorithm/src/main/java/binaryTree/TreeNode.java
create mode 100644 algorithm/src/main/java/binaryTree/ZigzagLevelOrderTraversal.java
create mode 100644 algorithm/src/main/java/competition/AverageValue.java
create mode 100644 algorithm/src/main/java/dataStructureDesign/InsertDeleteGetRandom.java
create mode 100644 algorithm/src/main/java/dataStructureDesign/LFUCache.java
create mode 100644 algorithm/src/main/java/dataStructureDesign/LRUCache.java
create mode 100644 algorithm/src/main/java/dataStructureDesign/LRUCache2.java
create mode 100644 algorithm/src/main/java/dataStructureDesign/MaximumFrequencyStack.java
create mode 100644 algorithm/src/main/java/dataStructureDesign/MinStack.java
create mode 100644 algorithm/src/main/java/differenceArray/CarPooling.java
create mode 100644 algorithm/src/main/java/differenceArray/FlightBooking.java
create mode 100644 algorithm/src/main/java/differenceArray/RangeAdd.java
create mode 100644 algorithm/src/main/java/graphTheory/AllPathList.java
create mode 100644 algorithm/src/main/java/images/binary-tree-traversal.jpg
create mode 100644 algorithm/src/main/java/images/graph.jpg
create mode 100644 algorithm/src/main/java/images/plugin4.png
create mode 100644 "algorithm/src/main/java/images/\344\272\214\345\217\211\346\240\221plugin1.png"
create mode 100644 "algorithm/src/main/java/images/\344\272\214\345\217\211\346\240\221plugin2.png"
create mode 100644 "algorithm/src/main/java/images/\344\272\214\345\217\211\346\240\221\344\276\213\345\255\220.jpg"
create mode 100644 "algorithm/src/main/java/images/\344\272\214\345\217\211\346\240\221\346\241\210\344\276\2132.png"
create mode 100644 "algorithm/src/main/java/images/\344\272\214\345\217\211\346\240\221\351\201\215\345\216\206.gif"
create mode 100644 "algorithm/src/main/java/images/\344\272\214\345\217\211\346\240\221\351\201\215\345\216\2062.jpeg"
create mode 100644 "algorithm/src/main/java/images/\345\211\215\344\270\255\345\220\216\345\272\217\344\272\214\345\217\211\346\240\221.jpeg"
create mode 100644 "algorithm/src/main/java/images/\345\211\215\345\272\217\345\220\216\347\273\255\351\201\215\345\216\206.jpeg"
create mode 100644 "algorithm/src/main/java/images/\345\211\215\345\272\217\351\201\215\345\216\2062.jpeg"
create mode 100644 "algorithm/src/main/java/images/\345\217\215\350\275\254\351\223\276\350\241\2502.jpg"
create mode 100644 "algorithm/src/main/java/images/\345\233\276\350\256\272\350\241\250\347\244\272\346\226\271\346\263\225.jpeg"
create mode 100644 "algorithm/src/main/java/images/\345\272\246.jpg"
create mode 100644 "algorithm/src/main/java/images/\345\276\252\347\216\257\351\201\215\345\216\206.jpeg"
create mode 100644 "algorithm/src/main/java/linkedList/doublePointer/19 \345\210\240\351\231\244\351\223\276\350\241\250\347\232\204\345\200\222\346\225\260\347\254\254N\344\270\252\350\212\202\347\202\271.md"
create mode 100644 "algorithm/src/main/java/linkedList/doublePointer/23 \345\220\210\345\271\266K\344\270\252\345\215\207\345\272\217\351\223\276\350\241\250.md"
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/AddTwoNumbers.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/AddTwoNumbers2.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/DeleteNthNode.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/LinkedListCycle.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/LinkedListCycleII.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/LinkedListIntersect.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/ListNode.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/MergeKSortedList.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/MergeSortedList.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/MiddleNode.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/PalindromeLinkedList.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/RemoveDuplicate.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/ReverseLinkedListII.java
create mode 100644 algorithm/src/main/java/linkedList/doublePointer/ReverseNodesInKGroup.java
create mode 100644 "algorithm/src/main/java/linkedList/doublePointer/\351\223\276\350\241\250+\345\217\214\346\214\207\351\222\210.md"
create mode 100644 algorithm/src/main/java/multiThread/FizzBuzz.java
create mode 100644 algorithm/src/main/java/multiThread/FizzBuzzII.java
create mode 100644 algorithm/src/main/java/multiThread/FizzBuzzIII.java
create mode 100644 algorithm/src/main/java/multiThread/PrintFooBarAlternately.java
create mode 100644 algorithm/src/main/java/multiThread/PrintInOrder.java
create mode 100644 algorithm/src/main/java/multiThread/PrintInOrder2.java
create mode 100644 algorithm/src/main/java/multiThread/PrintInOrder3.java
create mode 100644 algorithm/src/main/java/multiThread/PrintZeroOddEven.java
create mode 100644 algorithm/src/main/java/multiThread/ProduceH2O.java
create mode 100644 algorithm/src/main/java/nSum/NSum.java
create mode 100644 algorithm/src/main/java/nSum/ThreeSum.java
create mode 100644 algorithm/src/main/java/nSum/TwoSum.java
create mode 100644 algorithm/src/main/java/other/IsIsomorphic.java
create mode 100644 algorithm/src/main/java/prefixSum/MatrixSum.java
create mode 100644 algorithm/src/main/java/prefixSum/NumArray.java
create mode 100644 algorithm/src/main/java/prefixSum/NumMatrix.java
create mode 100644 algorithm/src/main/java/prefixSum/ProductOfNumbers.java
create mode 100644 algorithm/src/main/java/stack_queue/EvalRPN.java
create mode 100644 algorithm/src/main/java/stack_queue/ImplementQueueUsingStacks.java
create mode 100644 algorithm/src/main/java/stack_queue/ImplementStackUsingQueues.java
create mode 100644 algorithm/src/main/java/stack_queue/LongestValidParentheses.java
create mode 100644 algorithm/src/main/java/stack_queue/MinAddMakeValid.java
create mode 100644 algorithm/src/main/java/stack_queue/MinStack.java
create mode 100644 algorithm/src/main/java/stack_queue/MinimumInsertionsToBalanceParentheses.java
create mode 100644 algorithm/src/main/java/stack_queue/SimplifyPath.java
create mode 100644 algorithm/src/main/java/stack_queue/SlidingWindowMax.java
create mode 100644 algorithm/src/main/java/stack_queue/ValidParentheses.java
create mode 100644 algorithm/src/test/java/BSF_DSF/BinaryTreeLevelOrderTraversalIITest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/BinaryTreeLevelOrderTraversalTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/BinaryTreeZigzagLevelOrderTraversalTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/CountSubIslandsTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/MaxAreaIslandTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/MinimumDepthBinaryTreeTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/NumberClosedIslandsTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/NumberDistinctIslandsTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/NumberEnclavesTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/NumberIslandsTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/OpenTheLockTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/SlidingPuzzleTest.java
create mode 100644 algorithm/src/test/java/BSF_DSF/SurroundedRegionsTest.java
create mode 100644 algorithm/src/test/java/DP/BloodSimilarityTest.java
create mode 100644 algorithm/src/test/java/DP/DisjointLinesTest.java
create mode 100644 algorithm/src/test/java/DP/EnvelopsTest.java
create mode 100644 algorithm/src/test/java/DP/IsSubsequenceTest.java
create mode 100644 algorithm/src/test/java/DP/LongestCommonSubsequenceIITest.java
create mode 100644 algorithm/src/test/java/DP/LongestCommonSubsequenceTest.java
create mode 100644 algorithm/src/test/java/DP/MinFallingPathSum2Test.java
create mode 100644 algorithm/src/test/java/DP/MinFallingPathSumIITest.java
create mode 100644 algorithm/src/test/java/DP/MinFallingPathSumTest.java
create mode 100644 algorithm/src/test/java/DP/MinPathSumTest.java
create mode 100644 algorithm/src/test/java/DP/MinimumTriangleTotalIITest.java
create mode 100644 algorithm/src/test/java/DP/MinimumTriangleTotalTest.java
create mode 100644 algorithm/src/test/java/DP/PalindromeListTest.java
create mode 100644 algorithm/src/test/java/DP/ReverseNode2Test.java
create mode 100644 algorithm/src/test/java/DP/ReverseNode3Test.java
create mode 100644 algorithm/src/test/java/DP/ReverseNodeKGroupTest.java
create mode 100644 algorithm/src/test/java/DP/ReverseNodeTest.java
create mode 100644 algorithm/src/test/java/DP/RussianDollEnvelopesTest.java
create mode 100644 algorithm/src/test/java/DP/UniquePathsWithObstaclesTest.java
create mode 100644 algorithm/src/test/java/JavaStudy.java
create mode 100644 algorithm/src/test/java/alibaba/DuplicateLengthTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/EatBananaTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/IsSubsequenceTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/PeakArrayTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/PreimageSizeZFTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/SearchInsertPositionTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/SearchMatrixTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/SearchPositionTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/SearchRangeTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/ShipWithinDaysTest.java
create mode 100644 algorithm/src/test/java/array/binarySearch/TailingZerosTest.java
create mode 100644 algorithm/src/test/java/array/other/AdvantageShuffleTest.java
create mode 100644 algorithm/src/test/java/array/other/ContainerWithMostWaterTest.java
create mode 100644 algorithm/src/test/java/array/other/IntervalListIntersectionsTest.java
create mode 100644 algorithm/src/test/java/array/other/MaxRepeatSubStringTest.java
create mode 100644 algorithm/src/test/java/array/other/RemoveDuplicateSortedArrayTest.java
create mode 100644 algorithm/src/test/java/array/other/Search2DMatrixIITest.java
create mode 100644 algorithm/src/test/java/array/other/SquaresSortedArrayTest.java
create mode 100644 algorithm/src/test/java/array/other/TrappingRainWaterTest.java
create mode 100644 algorithm/src/test/java/array/other/TwoSumLessThanKTest.java
create mode 100644 algorithm/src/test/java/array/slideWIndow/FindAnagramsTest.java
create mode 100644 algorithm/src/test/java/array/slideWIndow/LengthOfLongestSubstringTest.java
create mode 100644 algorithm/src/test/java/array/slideWIndow/MinWindowSubstringTest.java
create mode 100644 algorithm/src/test/java/array/slideWIndow/MinimumWindowTest.java
create mode 100644 algorithm/src/test/java/array/slideWIndow/PermutationTest.java
create mode 100644 algorithm/src/test/java/array/slideWIndow/SlidingWindowMaximumTest.java
create mode 100644 algorithm/src/test/java/backTrack/CombinationSumTest.java
create mode 100644 algorithm/src/test/java/backTrack/CombinationsTest.java
create mode 100644 algorithm/src/test/java/backTrack/GenerateParenthesesTest.java
create mode 100644 algorithm/src/test/java/backTrack/MaximumDepthBinaryTreeTest.java
create mode 100644 algorithm/src/test/java/backTrack/NQueuesTest.java
create mode 100644 algorithm/src/test/java/backTrack/PartitionKEqualSumSubsetsTest.java
create mode 100644 algorithm/src/test/java/backTrack/PermutationsTest.java
create mode 100644 algorithm/src/test/java/backTrack/SubsetsTest.java
create mode 100644 algorithm/src/test/java/backTrack/SudokuSolverTest.java
create mode 100644 algorithm/src/test/java/backTrack/TargetSum2Test.java
create mode 100644 algorithm/src/test/java/backTrack/TargetSumTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/KthLargestDataTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/KthLargestElementTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/LRUCacheTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/MaxFrequencyTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/MedianDataTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/MergeSortedListsTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/MinStackTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/SeatReserveTest.java
create mode 100644 algorithm/src/test/java/binaryHeap/SingleThreadCPUTest.java
create mode 100644 algorithm/src/test/java/binaryTree/BinaryTreeLevelOrderTraversalTest.java
create mode 100644 algorithm/src/test/java/binaryTree/BinaryTreePostorderTraversalTest.java
create mode 100644 algorithm/src/test/java/binaryTree/BinaryTreeZigzagLevelOrderTraversalTest.java
create mode 100644 algorithm/src/test/java/binaryTree/DiameterBinaryTreeTest.java
create mode 100644 algorithm/src/test/java/binaryTree/FlattenBinaryTreeToLinkedListTest.java
create mode 100644 algorithm/src/test/java/binaryTree/InorderTraversalTest.java
create mode 100644 algorithm/src/test/java/binaryTree/IntegerTest.java
create mode 100644 algorithm/src/test/java/binaryTree/InvertBinaryTreeTest.java
create mode 100644 algorithm/src/test/java/binaryTree/MaximumDepthNTreeTest.java
create mode 100644 algorithm/src/test/java/binaryTree/MinimumDepthBinaryTreeTest.java
create mode 100644 algorithm/src/test/java/binaryTree/SameTree2Test.java
create mode 100644 algorithm/src/test/java/binaryTree/SerializeAndDeserializeBinaryTreeTest.java
create mode 100644 algorithm/src/test/java/dataStructureDesign/FlattenNestedListIterator.java
create mode 100644 algorithm/src/test/java/dataStructureDesign/InsertDeleteGetRandomTest.java
create mode 100644 algorithm/src/test/java/dataStructureDesign/LFUCacheTest.java
create mode 100644 algorithm/src/test/java/dataStructureDesign/LRUCache2Test.java
create mode 100644 algorithm/src/test/java/dataStructureDesign/LRUCacheTest.java
create mode 100644 algorithm/src/test/java/differenceArray/CarPoolingTest.java
create mode 100644 algorithm/src/test/java/differenceArray/FlightBookingTest.java
create mode 100644 algorithm/src/test/java/differenceArray/RangeAddTest.java
create mode 100644 algorithm/src/test/java/graphTherory/AllPathListTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/AddTwoNumbers2Test.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/AddTwoNumbersTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/DeleteNthNodeTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/LinkedListCycleIITest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/LinkedListCycleTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/LinkedListIntersectTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/MergeKSortedListTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/MergeSortedListTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/MiddleNodeTest.java
create mode 100644 algorithm/src/test/java/linkedList/doublePointer/RemoveDuplicateTest.java
create mode 100644 algorithm/src/test/java/nSum/NSumTest.java
create mode 100644 algorithm/src/test/java/nSum/ThreeSumTest.java
create mode 100644 algorithm/src/test/java/nSum/TwoSumTest.java
create mode 100644 algorithm/src/test/java/other/IsIsomorphicTest.java
create mode 100644 algorithm/src/test/java/prefixSum/MatrixSumTest.java
create mode 100644 algorithm/src/test/java/prefixSum/NumArrayTest.java
create mode 100644 algorithm/src/test/java/prefixSum/NumMatrixTest.java
create mode 100644 algorithm/src/test/java/prefixSum/ProductOfNumbersTest.java
create mode 100644 algorithm/src/test/java/stack_queue/EvalRPNTest.java
create mode 100644 algorithm/src/test/java/stack_queue/ImplementQueueUsingStacksTest.java
create mode 100644 algorithm/src/test/java/stack_queue/ImplementStackUsingQueuesTest.java
create mode 100644 algorithm/src/test/java/stack_queue/LongestValidParenthesesTest.java
create mode 100644 algorithm/src/test/java/stack_queue/MinAddMakeValidTest.java
create mode 100644 algorithm/src/test/java/stack_queue/MinStackTest.java
create mode 100644 algorithm/src/test/java/stack_queue/MinimumInsertionsToBalanceParenthesesTest.java
create mode 100644 algorithm/src/test/java/stack_queue/QueueTest.java
create mode 100644 algorithm/src/test/java/stack_queue/SimplifyPathTest.java
create mode 100644 algorithm/src/test/java/stack_queue/SlidingWindowMaxTest.java
create mode 100644 algorithm/src/test/java/stack_queue/ValidParenthesesTest.java
create mode 100644 algorithm/target/classes/BFS_DFS/BinaryTreeLevelOrderTraversal.class
create mode 100644 algorithm/target/classes/BFS_DFS/BinaryTreeLevelOrderTraversalII.class
create mode 100644 algorithm/target/classes/BFS_DFS/BinaryTreeZigzagLevelOrderTraversal.class
create mode 100644 algorithm/target/classes/BFS_DFS/CountSubIslands.class
create mode 100644 algorithm/target/classes/BFS_DFS/MaxAreaIsland.class
create mode 100644 algorithm/target/classes/BFS_DFS/MinimumDepthBinaryTree.class
create mode 100644 algorithm/target/classes/BFS_DFS/NumberClosedIslands.class
create mode 100644 algorithm/target/classes/BFS_DFS/NumberDistinctIslands.class
create mode 100644 algorithm/target/classes/BFS_DFS/NumberEnclaves.class
create mode 100644 algorithm/target/classes/BFS_DFS/NumberIslands.class
create mode 100644 algorithm/target/classes/BFS_DFS/OpenTheLock.class
create mode 100644 algorithm/target/classes/BFS_DFS/SlidingPuzzle.class
create mode 100644 algorithm/target/classes/BFS_DFS/SurroundedRegions.class
create mode 100644 algorithm/target/classes/DP/BloodSimilarity.class
create mode 100644 algorithm/target/classes/DP/DisjointLines.class
create mode 100644 algorithm/target/classes/DP/Envelops$1.class
create mode 100644 algorithm/target/classes/DP/Envelops.class
create mode 100644 algorithm/target/classes/DP/IsSubsequence.class
create mode 100644 algorithm/target/classes/DP/LongestCommonSubsequence.class
create mode 100644 algorithm/target/classes/DP/LongestCommonSubsequenceII.class
create mode 100644 algorithm/target/classes/DP/MinFallingPathSum.class
create mode 100644 algorithm/target/classes/DP/MinFallingPathSum2.class
create mode 100644 algorithm/target/classes/DP/MinFallingPathSumII.class
create mode 100644 algorithm/target/classes/DP/MinPathSum.class
create mode 100644 algorithm/target/classes/DP/MinimumTriangleTotal.class
create mode 100644 algorithm/target/classes/DP/MinimumTriangleTotalII.class
create mode 100644 algorithm/target/classes/DP/PalindromeList.class
create mode 100644 algorithm/target/classes/DP/ReverseNode.class
create mode 100644 algorithm/target/classes/DP/ReverseNode2.class
create mode 100644 algorithm/target/classes/DP/ReverseNode3.class
create mode 100644 algorithm/target/classes/DP/ReverseNodeKGroup.class
create mode 100644 algorithm/target/classes/DP/RussianDollEnvelopes$1.class
create mode 100644 algorithm/target/classes/DP/RussianDollEnvelopes.class
create mode 100644 algorithm/target/classes/DP/UniquePathsWithObstacles.class
create mode 100644 algorithm/target/classes/alibaba/DuplicateLength.class
create mode 100644 algorithm/target/classes/alibaba/ThreadPrintABC$1.class
create mode 100644 algorithm/target/classes/alibaba/ThreadPrintABC.class
create mode 100644 algorithm/target/classes/alibaba/ThreadPrintABC2.class
create mode 100644 algorithm/target/classes/alibaba/ThreadPrintCharNum.class
create mode 100644 algorithm/target/classes/alibaba/ThreadPrintNums.class
create mode 100644 algorithm/target/classes/array/binarySearch/EatBanana.class
create mode 100644 algorithm/target/classes/array/binarySearch/IsSubsequence.class
create mode 100644 algorithm/target/classes/array/binarySearch/PeakArray.class
create mode 100644 algorithm/target/classes/array/binarySearch/PreimageSizeZF.class
create mode 100644 algorithm/target/classes/array/binarySearch/SearchInsertPosition.class
create mode 100644 algorithm/target/classes/array/binarySearch/SearchMatrix.class
create mode 100644 algorithm/target/classes/array/binarySearch/SearchPosition.class
create mode 100644 algorithm/target/classes/array/binarySearch/SearchRange.class
create mode 100644 algorithm/target/classes/array/binarySearch/ShipWithinDays.class
create mode 100644 algorithm/target/classes/array/binarySearch/TailingZeros.class
create mode 100644 algorithm/target/classes/array/other/AdvantageShuffle.class
create mode 100644 algorithm/target/classes/array/other/ContainerWithMostWater.class
create mode 100644 algorithm/target/classes/array/other/IntervalListIntersections.class
create mode 100644 algorithm/target/classes/array/other/MaxRepeatSubString.class
create mode 100644 algorithm/target/classes/array/other/RemoveDuplicateSortedArray.class
create mode 100644 algorithm/target/classes/array/other/Search2DMatrixII.class
create mode 100644 algorithm/target/classes/array/other/SquaresSortedArray.class
create mode 100644 algorithm/target/classes/array/other/TrappingRainWater.class
create mode 100644 algorithm/target/classes/array/other/TwoSumLessThanK.class
create mode 100644 algorithm/target/classes/array/slideWindow/FindAnagrams.class
create mode 100644 algorithm/target/classes/array/slideWindow/LengthOfLongestSubstring.class
create mode 100644 algorithm/target/classes/array/slideWindow/MinWindowSubstring.class
create mode 100644 algorithm/target/classes/array/slideWindow/MinimumWindow.class
create mode 100644 algorithm/target/classes/array/slideWindow/MonotonicMinQueue.class
create mode 100644 algorithm/target/classes/array/slideWindow/MonotonicQueue.class
create mode 100644 algorithm/target/classes/array/slideWindow/Permutation.class
create mode 100644 algorithm/target/classes/array/slideWindow/SlidingWindowMaximum.class
create mode 100644 algorithm/target/classes/backTrack/CombinationSum.class
create mode 100644 algorithm/target/classes/backTrack/Combinations.class
create mode 100644 algorithm/target/classes/backTrack/GenerateParentheses.class
create mode 100644 algorithm/target/classes/backTrack/MaximumDepthBinaryTree.class
create mode 100644 algorithm/target/classes/backTrack/NQueues.class
create mode 100644 algorithm/target/classes/backTrack/PartitionKEqualSumSubsets.class
create mode 100644 algorithm/target/classes/backTrack/Permutations.class
create mode 100644 algorithm/target/classes/backTrack/Subsets.class
create mode 100644 algorithm/target/classes/backTrack/SudokuSolver.class
create mode 100644 algorithm/target/classes/backTrack/TargetSum.class
create mode 100644 algorithm/target/classes/backTrack/TargetSum2.class
create mode 100644 algorithm/target/classes/binaryHeap/KthLargestData.class
create mode 100644 algorithm/target/classes/binaryHeap/KthLargestElement.class
create mode 100644 algorithm/target/classes/binaryHeap/MaxFrequency.class
create mode 100644 algorithm/target/classes/binaryHeap/MedianData.class
create mode 100644 algorithm/target/classes/binaryHeap/MinStack.class
create mode 100644 algorithm/target/classes/binaryHeap/SeatReserve.class
create mode 100644 algorithm/target/classes/binaryHeap/SingleThreadCPU$1Task.class
create mode 100644 algorithm/target/classes/binaryHeap/SingleThreadCPU.class
create mode 100644 algorithm/target/classes/binaryTree/BinaryTreeLevelOrderTraversal.class
create mode 100644 algorithm/target/classes/binaryTree/BinaryTreePostorderTraversal.class
create mode 100644 algorithm/target/classes/binaryTree/BinaryTreeZigzagLevelOrderTraversal.class
create mode 100644 algorithm/target/classes/binaryTree/DiameterBinaryTree.class
create mode 100644 algorithm/target/classes/binaryTree/FlattenBinaryTreeToLinkedList.class
create mode 100644 algorithm/target/classes/binaryTree/InorderTraversal.class
create mode 100644 algorithm/target/classes/binaryTree/InvertBinaryTree.class
create mode 100644 algorithm/target/classes/binaryTree/LevelOrderTraversal.class
create mode 100644 algorithm/target/classes/binaryTree/MaximumDepth.class
create mode 100644 algorithm/target/classes/binaryTree/MaximumDepthNTree.class
create mode 100644 algorithm/target/classes/binaryTree/MinimumDepthBinaryTree.class
create mode 100644 algorithm/target/classes/binaryTree/SameTree.class
create mode 100644 algorithm/target/classes/binaryTree/SameTree2.class
create mode 100644 algorithm/target/classes/binaryTree/SerializeAndDeserializeBinaryTree.class
create mode 100644 algorithm/target/classes/binaryTree/TreeNode.class
create mode 100644 algorithm/target/classes/binaryTree/ZigzagLevelOrderTraversal.class
create mode 100644 algorithm/target/classes/dataStructureDesign/InsertDeleteGetRandom.class
create mode 100644 algorithm/target/classes/dataStructureDesign/LFUCache.class
create mode 100644 algorithm/target/classes/dataStructureDesign/LFUNode.class
create mode 100644 algorithm/target/classes/dataStructureDesign/LRUCache.class
create mode 100644 algorithm/target/classes/dataStructureDesign/LRUCache2.class
create mode 100644 algorithm/target/classes/dataStructureDesign/MaximumFrequencyStack.class
create mode 100644 algorithm/target/classes/dataStructureDesign/MinStack.class
create mode 100644 algorithm/target/classes/dataStructureDesign/Node.class
create mode 100644 algorithm/target/classes/differenceArray/CarPooling.class
create mode 100644 algorithm/target/classes/differenceArray/FlightBooking.class
create mode 100644 algorithm/target/classes/differenceArray/RangeAdd.class
create mode 100644 algorithm/target/classes/graphTheory/AllPathList.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/AddTwoNumbers.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/AddTwoNumbers2.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/DeleteNthNode.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/LinkedListCycle.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/LinkedListCycleII.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/LinkedListIntersect.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/ListNode.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/MergeKSortedList.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/MergeSortedList.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/MiddleNode.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/PalindromeLinkedList.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/RemoveDuplicate.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/ReverseLinkedListII.class
create mode 100644 algorithm/target/classes/linkedList/doublePointer/ReverseNodesInKGroup.class
create mode 100644 algorithm/target/classes/multiThread/FizzBuzz.class
create mode 100644 algorithm/target/classes/multiThread/FizzBuzzII$1.class
create mode 100644 algorithm/target/classes/multiThread/FizzBuzzII$2.class
create mode 100644 algorithm/target/classes/multiThread/FizzBuzzII$3.class
create mode 100644 algorithm/target/classes/multiThread/FizzBuzzII.class
create mode 100644 algorithm/target/classes/multiThread/FizzBuzzIII.class
create mode 100644 algorithm/target/classes/multiThread/IntConsumer.class
create mode 100644 algorithm/target/classes/multiThread/PrintFooBarAlternately$1.class
create mode 100644 algorithm/target/classes/multiThread/PrintFooBarAlternately$2.class
create mode 100644 algorithm/target/classes/multiThread/PrintFooBarAlternately.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder$1.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder$2.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder$3.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder2$1.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder2$2.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder2$3.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder2.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder3$1.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder3$2.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder3$3.class
create mode 100644 algorithm/target/classes/multiThread/PrintInOrder3.class
create mode 100644 algorithm/target/classes/multiThread/PrintZeroOddEven.class
create mode 100644 algorithm/target/classes/multiThread/ProduceH2O.class
create mode 100644 algorithm/target/classes/nSum/NSum.class
create mode 100644 algorithm/target/classes/nSum/ThreeSum.class
create mode 100644 algorithm/target/classes/nSum/TwoSum.class
create mode 100644 algorithm/target/classes/offer/Divide.class
create mode 100644 algorithm/target/classes/other/IsIsomorphic.class
create mode 100644 algorithm/target/classes/prefixSum/MatrixSum.class
create mode 100644 algorithm/target/classes/prefixSum/NumArray.class
create mode 100644 algorithm/target/classes/prefixSum/NumMatrix.class
create mode 100644 algorithm/target/classes/prefixSum/ProductOfNumbers.class
create mode 100644 algorithm/target/classes/stack_queue/EvalRPN.class
create mode 100644 algorithm/target/classes/stack_queue/ImplementQueueUsingStacks.class
create mode 100644 algorithm/target/classes/stack_queue/ImplementStackUsingQueues.class
create mode 100644 algorithm/target/classes/stack_queue/LongestValidParentheses.class
create mode 100644 algorithm/target/classes/stack_queue/MinAddMakeValid.class
create mode 100644 algorithm/target/classes/stack_queue/MinStack.class
create mode 100644 algorithm/target/classes/stack_queue/MinimumInsertionsToBalanceParentheses.class
create mode 100644 algorithm/target/classes/stack_queue/MonotonicQueue.class
create mode 100644 algorithm/target/classes/stack_queue/SimplifyPath.class
create mode 100644 algorithm/target/classes/stack_queue/SlidingWindowMax.class
create mode 100644 algorithm/target/classes/stack_queue/ValidParentheses.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/BinaryTreeLevelOrderTraversalIITest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/BinaryTreeLevelOrderTraversalTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/BinaryTreeZigzagLevelOrderTraversalTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/CountSubIslandsTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/MaxAreaIslandTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/MinimumDepthBinaryTreeTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/NumberClosedIslandsTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/NumberDistinctIslandsTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/NumberEnclavesTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/NumberIslandsTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/OpenTheLockTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/SlidingPuzzleTest.class
create mode 100644 algorithm/target/test-classes/BSF_DSF/SurroundedRegionsTest.class
create mode 100644 algorithm/target/test-classes/DP/BloodSimilarityTest.class
create mode 100644 algorithm/target/test-classes/DP/DisjointLinesTest.class
create mode 100644 algorithm/target/test-classes/DP/EnvelopsTest.class
create mode 100644 algorithm/target/test-classes/DP/IsSubsequenceTest.class
create mode 100644 algorithm/target/test-classes/DP/LongestCommonSubsequenceIITest.class
create mode 100644 algorithm/target/test-classes/DP/LongestCommonSubsequenceTest.class
create mode 100644 algorithm/target/test-classes/DP/MinFallingPathSum2Test.class
create mode 100644 algorithm/target/test-classes/DP/MinFallingPathSumIITest.class
create mode 100644 algorithm/target/test-classes/DP/MinFallingPathSumTest.class
create mode 100644 algorithm/target/test-classes/DP/MinPathSumTest.class
create mode 100644 algorithm/target/test-classes/DP/MinimumTriangleTotalIITest.class
create mode 100644 algorithm/target/test-classes/DP/MinimumTriangleTotalTest.class
create mode 100644 algorithm/target/test-classes/DP/PalindromeListTest.class
create mode 100644 algorithm/target/test-classes/DP/ReverseNode2Test.class
create mode 100644 algorithm/target/test-classes/DP/ReverseNode3Test.class
create mode 100644 algorithm/target/test-classes/DP/ReverseNodeKGroupTest.class
create mode 100644 algorithm/target/test-classes/DP/ReverseNodeTest.class
create mode 100644 algorithm/target/test-classes/DP/RussianDollEnvelopesTest.class
create mode 100644 algorithm/target/test-classes/DP/UniquePathsWithObstaclesTest.class
create mode 100644 algorithm/target/test-classes/JavaStudy.class
create mode 100644 algorithm/target/test-classes/alibaba/DuplicateLengthTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/EatBananaTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/IsSubsequenceTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/PeakArrayTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/PreimageSizeZFTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/SearchInsertPositionTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/SearchMatrixTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/SearchPositionTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/SearchRangeTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/ShipWithinDaysTest.class
create mode 100644 algorithm/target/test-classes/array/binarySearch/TailingZerosTest.class
create mode 100644 algorithm/target/test-classes/array/other/AdvantageShuffleTest.class
create mode 100644 algorithm/target/test-classes/array/other/ContainerWithMostWaterTest.class
create mode 100644 algorithm/target/test-classes/array/other/IntervalListIntersectionsTest.class
create mode 100644 algorithm/target/test-classes/array/other/MaxRepeatSubStringTest.class
create mode 100644 algorithm/target/test-classes/array/other/RemoveDuplicateSortedArrayTest.class
create mode 100644 algorithm/target/test-classes/array/other/Search2DMatrixIITest.class
create mode 100644 algorithm/target/test-classes/array/other/SquaresSortedArrayTest.class
create mode 100644 algorithm/target/test-classes/array/other/TrappingRainWaterTest.class
create mode 100644 algorithm/target/test-classes/array/other/TwoSumLessThanKTest.class
create mode 100644 algorithm/target/test-classes/array/slideWIndow/FindAnagramsTest.class
create mode 100644 algorithm/target/test-classes/array/slideWIndow/LengthOfLongestSubstringTest.class
create mode 100644 algorithm/target/test-classes/array/slideWIndow/MinWindowSubstringTest.class
create mode 100644 algorithm/target/test-classes/array/slideWIndow/MinimumWindowTest.class
create mode 100644 algorithm/target/test-classes/array/slideWIndow/PermutationTest.class
create mode 100644 algorithm/target/test-classes/array/slideWIndow/SlidingWindowMaximumTest.class
create mode 100644 algorithm/target/test-classes/backTrack/CombinationSumTest.class
create mode 100644 algorithm/target/test-classes/backTrack/CombinationsTest.class
create mode 100644 algorithm/target/test-classes/backTrack/GenerateParenthesesTest.class
create mode 100644 algorithm/target/test-classes/backTrack/MaximumDepthBinaryTreeTest.class
create mode 100644 algorithm/target/test-classes/backTrack/NQueuesTest.class
create mode 100644 algorithm/target/test-classes/backTrack/PartitionKEqualSumSubsetsTest.class
create mode 100644 algorithm/target/test-classes/backTrack/PermutationsTest.class
create mode 100644 algorithm/target/test-classes/backTrack/SubsetsTest.class
create mode 100644 algorithm/target/test-classes/backTrack/SudokuSolverTest.class
create mode 100644 algorithm/target/test-classes/backTrack/TargetSum2Test.class
create mode 100644 algorithm/target/test-classes/backTrack/TargetSumTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/KthLargestDataTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/KthLargestElementTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/LRUCacheTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/MaxFrequencyTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/MedianDataTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/MergeSortedListsTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/MinStackTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/SeatReserveTest.class
create mode 100644 algorithm/target/test-classes/binaryHeap/SingleThreadCPUTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/BinaryTreeLevelOrderTraversalTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/BinaryTreePostorderTraversalTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/BinaryTreeZigzagLevelOrderTraversalTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/DiameterBinaryTreeTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/FlattenBinaryTreeToLinkedListTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/InorderTraversalTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/IntegerTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/InvertBinaryTreeTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/MaximumDepthNTreeTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/MinimumDepthBinaryTreeTest.class
create mode 100644 algorithm/target/test-classes/binaryTree/SameTree2Test.class
create mode 100644 algorithm/target/test-classes/binaryTree/SerializeAndDeserializeBinaryTreeTest.class
create mode 100644 algorithm/target/test-classes/dataStructureDesign/FlattenNestedListIterator.class
create mode 100644 algorithm/target/test-classes/dataStructureDesign/InsertDeleteGetRandomTest.class
create mode 100644 algorithm/target/test-classes/dataStructureDesign/LFUCacheTest.class
create mode 100644 algorithm/target/test-classes/dataStructureDesign/LRUCache2Test.class
create mode 100644 algorithm/target/test-classes/dataStructureDesign/LRUCacheTest.class
create mode 100644 algorithm/target/test-classes/dataStructureDesign/NestedInteger.class
create mode 100644 algorithm/target/test-classes/differenceArray/CarPoolingTest.class
create mode 100644 algorithm/target/test-classes/differenceArray/FlightBookingTest.class
create mode 100644 algorithm/target/test-classes/differenceArray/RangeAddTest.class
create mode 100644 algorithm/target/test-classes/graphTherory/AllPathListTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/AddTwoNumbers2Test.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/AddTwoNumbersTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/DeleteNthNodeTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/LinkedListCycleIITest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/LinkedListCycleTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/LinkedListIntersectTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/MergeKSortedListTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/MergeSortedListTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/MiddleNodeTest.class
create mode 100644 algorithm/target/test-classes/linkedList/doublePointer/RemoveDuplicateTest.class
create mode 100644 algorithm/target/test-classes/nSum/NSumTest.class
create mode 100644 algorithm/target/test-classes/nSum/ThreeSumTest.class
create mode 100644 algorithm/target/test-classes/nSum/TwoSumTest.class
create mode 100644 algorithm/target/test-classes/offer/DivideTest.class
create mode 100644 algorithm/target/test-classes/other/IsIsomorphicTest.class
create mode 100644 algorithm/target/test-classes/prefixSum/MatrixSumTest.class
create mode 100644 algorithm/target/test-classes/prefixSum/NumArrayTest.class
create mode 100644 algorithm/target/test-classes/prefixSum/NumMatrixTest.class
create mode 100644 algorithm/target/test-classes/prefixSum/ProductOfNumbersTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/EvalRPNTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/ImplementQueueUsingStacksTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/ImplementStackUsingQueuesTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/LongestValidParenthesesTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/MinAddMakeValidTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/MinStackTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/MinimumInsertionsToBalanceParenthesesTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/QueueTest$QueueNode.class
create mode 100644 algorithm/target/test-classes/stack_queue/QueueTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/SimplifyPathTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/SlidingWindowMaxTest.class
create mode 100644 algorithm/target/test-classes/stack_queue/ValidParenthesesTest.class
create mode 100644 leetcode/target/classes/AreNumbersAscending.class
create mode 100644 leetcode/target/classes/ArrayStringsAreEqual.class
create mode 100644 leetcode/target/classes/ArrayStringsAreEqualRedoI.class
create mode 100644 leetcode/target/classes/BuildTree.class
create mode 100644 leetcode/target/classes/CanJump.class
create mode 100644 leetcode/target/classes/CheckInclusion.class
create mode 100644 leetcode/target/classes/CheckOnesSegment.class
create mode 100644 leetcode/target/classes/CombinationSum.class
create mode 100644 leetcode/target/classes/CombinationSum2.class
create mode 100644 leetcode/target/classes/Combine.class
create mode 100644 leetcode/target/classes/CommonChars.class
create mode 100644 leetcode/target/classes/CountPrimes.class
create mode 100644 leetcode/target/classes/CuttingRope.class
create mode 100644 leetcode/target/classes/CuttingRopeII.class
create mode 100644 leetcode/target/classes/DecodeString.class
create mode 100644 leetcode/target/classes/DeleteAndEarn.class
create mode 100644 leetcode/target/classes/DeleteDuplicates.class
create mode 100644 leetcode/target/classes/DeleteDuplicatesII.class
create mode 100644 leetcode/target/classes/Divide.class
create mode 100644 leetcode/target/classes/Exist.class
create mode 100644 leetcode/target/classes/Expand.class
create mode 100644 leetcode/target/classes/FindDuplicate.class
create mode 100644 leetcode/target/classes/FindMedianSortedArrays.class
create mode 100644 leetcode/target/classes/FindMedianSortedArraysII.class
create mode 100644 leetcode/target/classes/FindMedianSortedArraysIII.class
create mode 100644 leetcode/target/classes/FindMin.class
create mode 100644 leetcode/target/classes/FindPeakElement.class
create mode 100644 leetcode/target/classes/FirstMissingPositive.class
create mode 100644 leetcode/target/classes/FourSum.class
create mode 100644 leetcode/target/classes/FullJustify.class
create mode 100644 leetcode/target/classes/GenerateParenthesis.class
create mode 100644 leetcode/target/classes/GroupAnagrams.class
create mode 100644 leetcode/target/classes/HIndexII.class
create mode 100644 leetcode/target/classes/HammingWeight.class
create mode 100644 leetcode/target/classes/InsertInterval.class
create mode 100644 leetcode/target/classes/IntToRoman.class
create mode 100644 leetcode/target/classes/IntegerReverse.class
create mode 100644 leetcode/target/classes/IsInterleave.class
create mode 100644 leetcode/target/classes/IsMatch.class
create mode 100644 leetcode/target/classes/IsNumber$1.class
create mode 100644 leetcode/target/classes/IsNumber$2.class
create mode 100644 leetcode/target/classes/IsNumber$3.class
create mode 100644 leetcode/target/classes/IsNumber$4.class
create mode 100644 leetcode/target/classes/IsNumber$5.class
create mode 100644 leetcode/target/classes/IsNumber$6.class
create mode 100644 leetcode/target/classes/IsNumber$7.class
create mode 100644 leetcode/target/classes/IsNumber$8.class
create mode 100644 leetcode/target/classes/IsNumber$9.class
create mode 100644 leetcode/target/classes/IsNumber.class
create mode 100644 leetcode/target/classes/IsSubstructure.class
create mode 100644 leetcode/target/classes/Jump.class
create mode 100644 leetcode/target/classes/LengthOfLIS.class
create mode 100644 leetcode/target/classes/LengthOfLastWord.class
create mode 100644 leetcode/target/classes/LetterCasePermutation.class
create mode 100644 leetcode/target/classes/LetterCombinations.class
create mode 100644 leetcode/target/classes/ListNode.class
create mode 100644 leetcode/target/classes/LongestPalindrome.class
create mode 100644 leetcode/target/classes/LongestValidParentheses.class
create mode 100644 leetcode/target/classes/LongestValidParenthesesII.class
create mode 100644 leetcode/target/classes/META-INF/leetcode.kotlin_module
create mode 100644 leetcode/target/classes/MaxArea.class
create mode 100644 leetcode/target/classes/MaxPoints.class
create mode 100644 leetcode/target/classes/MaxSubArray.class
create mode 100644 leetcode/target/classes/MaxSubArrayII.class
create mode 100644 leetcode/target/classes/MaxSubarraySumCircular.class
create mode 100644 leetcode/target/classes/MaxSubarraySumCircularII.class
create mode 100644 leetcode/target/classes/MergeIntervals.class
create mode 100644 leetcode/target/classes/MergeIntervalsII.class
create mode 100644 leetcode/target/classes/MergeKLists.class
create mode 100644 leetcode/target/classes/MergeTwoLists.class
create mode 100644 leetcode/target/classes/MiddleNode.class
create mode 100644 leetcode/target/classes/MinArea.class
create mode 100644 leetcode/target/classes/MinMeetingRooms.class
create mode 100644 leetcode/target/classes/Multiply.class
create mode 100644 leetcode/target/classes/MyAtoi.class
create mode 100644 leetcode/target/classes/MyPow.class
create mode 100644 leetcode/target/classes/MySqrt.class
create mode 100644 leetcode/target/classes/NQueens.class
create mode 100644 leetcode/target/classes/NQueens2.class
create mode 100644 leetcode/target/classes/Node.class
create mode 100644 leetcode/target/classes/NumMatchingSubseq.class
create mode 100644 leetcode/target/classes/OrderCycleLinkedList.class
create mode 100644 leetcode/target/classes/Partition.class
create mode 100644 leetcode/target/classes/ReadBinaryWatch.class
create mode 100644 leetcode/target/classes/RecordSpaces.class
create mode 100644 leetcode/target/classes/RemoveDuplicates.class
create mode 100644 leetcode/target/classes/RemoveZeroSumSublists.class
create mode 100644 leetcode/target/classes/ReorderList.class
create mode 100644 leetcode/target/classes/ReorderListII.class
create mode 100644 leetcode/target/classes/ReverseBits.class
create mode 100644 leetcode/target/classes/ReverseLeftWords.class
create mode 100644 leetcode/target/classes/ReverseList.class
create mode 100644 leetcode/target/classes/ReverseWords.class
create mode 100644 leetcode/target/classes/ReverseWords2.class
create mode 100644 leetcode/target/classes/Rob.class
create mode 100644 leetcode/target/classes/Rob2.class
create mode 100644 leetcode/target/classes/Search.class
create mode 100644 leetcode/target/classes/SearchII.class
create mode 100644 leetcode/target/classes/SearchMatrixII.class
create mode 100644 leetcode/target/classes/SearchRange.class
create mode 100644 leetcode/target/classes/SimplifyPath.class
create mode 100644 leetcode/target/classes/SortColors.class
create mode 100644 leetcode/target/classes/SpiralOrder.class
create mode 100644 leetcode/target/classes/SplitIntoFibonacci.class
create mode 100644 leetcode/target/classes/StrStr.class
create mode 100644 leetcode/target/classes/Subsets.class
create mode 100644 leetcode/target/classes/SubsetsWithDup.class
create mode 100644 leetcode/target/classes/SwapPairs.class
create mode 100644 leetcode/target/classes/ThreeSum.class
create mode 100644 leetcode/target/classes/ThreeSumClosest.class
create mode 100644 leetcode/target/classes/ThreeSumSmaller.class
create mode 100644 leetcode/target/classes/Trap.class
create mode 100644 leetcode/target/classes/TreeNode.class
create mode 100644 leetcode/target/classes/ValidateStackSequences.class
create mode 100644 leetcode/target/classes/ZigZagConvert.class
create mode 100644 leetcode/target/test-classes/AreNumbersAscendingTest.class
create mode 100644 leetcode/target/test-classes/ArrayStringsAreEqualRedoITest.class
create mode 100644 leetcode/target/test-classes/ArrayStringsAreEqualTest.class
create mode 100644 leetcode/target/test-classes/CanJumpTest.class
create mode 100644 leetcode/target/test-classes/CheckInclusionTest.class
create mode 100644 leetcode/target/test-classes/CheckOnesSegmentTest.class
create mode 100644 leetcode/target/test-classes/CombinationSum2Test.class
create mode 100644 leetcode/target/test-classes/CombinationSumTest.class
create mode 100644 leetcode/target/test-classes/CombineTest.class
create mode 100644 leetcode/target/test-classes/CommonCharsTest.class
create mode 100644 leetcode/target/test-classes/CountPrimesTest.class
create mode 100644 leetcode/target/test-classes/CuttingRopeIITest.class
create mode 100644 leetcode/target/test-classes/CuttingRopeTest.class
create mode 100644 leetcode/target/test-classes/DecodeStringTest.class
create mode 100644 leetcode/target/test-classes/DeleteAndEarnTest.class
create mode 100644 leetcode/target/test-classes/DeleteDuplicatesIITest.class
create mode 100644 leetcode/target/test-classes/DeleteDuplicatesTest.class
create mode 100644 leetcode/target/test-classes/DivideTest.class
create mode 100644 leetcode/target/test-classes/ExistTest.class
create mode 100644 leetcode/target/test-classes/ExpandTest.class
create mode 100644 leetcode/target/test-classes/FindDuplicateTest.class
create mode 100644 leetcode/target/test-classes/FindMedianSortedArraysIIITest.class
create mode 100644 leetcode/target/test-classes/FindMedianSortedArraysIITest.class
create mode 100644 leetcode/target/test-classes/FindMedianSortedArraysTest.class
create mode 100644 leetcode/target/test-classes/FindMinTest.class
create mode 100644 leetcode/target/test-classes/FindPeakElementTest.class
create mode 100644 leetcode/target/test-classes/FirstMissingPositiveTest.class
create mode 100644 leetcode/target/test-classes/FourSumTest.class
create mode 100644 leetcode/target/test-classes/FullJustifyTest.class
create mode 100644 leetcode/target/test-classes/GenerateParenthesisTest.class
create mode 100644 leetcode/target/test-classes/GroupAnagramsTest.class
create mode 100644 leetcode/target/test-classes/HIndexIITest.class
create mode 100644 leetcode/target/test-classes/HammingWeightTest.class
create mode 100644 leetcode/target/test-classes/InsertIntervalTest.class
create mode 100644 leetcode/target/test-classes/IntToRomanTest.class
create mode 100644 leetcode/target/test-classes/IntegerReverseTest.class
create mode 100644 leetcode/target/test-classes/IsInterleaveTest.class
create mode 100644 leetcode/target/test-classes/IsMatchTest.class
create mode 100644 leetcode/target/test-classes/IsNumberTest.class
create mode 100644 leetcode/target/test-classes/IsSubstructureTest.class
create mode 100644 leetcode/target/test-classes/JumpTest.class
create mode 100644 leetcode/target/test-classes/LengthOfLastWordTest.class
create mode 100644 leetcode/target/test-classes/LetterCasePermutationTest.class
create mode 100644 leetcode/target/test-classes/LetterCombinationsTest.class
create mode 100644 leetcode/target/test-classes/LongestOfLISTest.class
create mode 100644 leetcode/target/test-classes/LongestPalindromeTest.class
create mode 100644 leetcode/target/test-classes/LongestValidParenthesesIITest.class
create mode 100644 leetcode/target/test-classes/LongestValidParenthesesTest.class
create mode 100644 leetcode/target/test-classes/META-INF/leetcode.kotlin_module
create mode 100644 leetcode/target/test-classes/MaxAreaTest.class
create mode 100644 leetcode/target/test-classes/MaxPointsTest.class
create mode 100644 leetcode/target/test-classes/MaxSubArrayIITest.class
create mode 100644 leetcode/target/test-classes/MaxSubArrayTest.class
create mode 100644 leetcode/target/test-classes/MaxSubarraySumCircularIITest.class
create mode 100644 leetcode/target/test-classes/MaxSubarraySumCircularTest.class
create mode 100644 leetcode/target/test-classes/MergeIntervalsIITest.class
create mode 100644 leetcode/target/test-classes/MergeIntervalsTest.class
create mode 100644 leetcode/target/test-classes/MergeKListsTest.class
create mode 100644 leetcode/target/test-classes/MergeTwoListsTest.class
create mode 100644 leetcode/target/test-classes/MinAreaTest.class
create mode 100644 leetcode/target/test-classes/MinMeetingRoomsTest.class
create mode 100644 leetcode/target/test-classes/MultiplyTest.class
create mode 100644 leetcode/target/test-classes/MyAtoiTest.class
create mode 100644 leetcode/target/test-classes/MyPowTest.class
create mode 100644 leetcode/target/test-classes/MySqrtTest.class
create mode 100644 leetcode/target/test-classes/NQueens2Test.class
create mode 100644 leetcode/target/test-classes/NQueensTest.class
create mode 100644 leetcode/target/test-classes/NumMatchingSubseqTest.class
create mode 100644 leetcode/target/test-classes/OrderCycleLinkedListTest.class
create mode 100644 leetcode/target/test-classes/PartitionTest.class
create mode 100644 leetcode/target/test-classes/ReadBinaryWatchTest.class
create mode 100644 leetcode/target/test-classes/RecordSpacesTest.class
create mode 100644 leetcode/target/test-classes/RemoveDuplicatesTest.class
create mode 100644 leetcode/target/test-classes/RemoveZeroSumSublistsTest.class
create mode 100644 leetcode/target/test-classes/ReorderListIITest.class
create mode 100644 leetcode/target/test-classes/ReorderListTest.class
create mode 100644 leetcode/target/test-classes/ReverseBitsTest.class
create mode 100644 leetcode/target/test-classes/ReverseLeftWordsTest.class
create mode 100644 leetcode/target/test-classes/ReverseListTest.class
create mode 100644 leetcode/target/test-classes/ReverseWords2Test.class
create mode 100644 leetcode/target/test-classes/ReverseWordsTest.class
create mode 100644 leetcode/target/test-classes/Rob2Test.class
create mode 100644 leetcode/target/test-classes/RobTest.class
create mode 100644 leetcode/target/test-classes/SearchIITest.class
create mode 100644 leetcode/target/test-classes/SearchMatrixIITest.class
create mode 100644 leetcode/target/test-classes/SearchRangeTest.class
create mode 100644 leetcode/target/test-classes/SearchTest.class
create mode 100644 leetcode/target/test-classes/SimplifyPathTest.class
create mode 100644 leetcode/target/test-classes/SortColorsTest.class
create mode 100644 leetcode/target/test-classes/SpiralOrderTest.class
create mode 100644 leetcode/target/test-classes/SplitIntoFibonacciTest.class
create mode 100644 leetcode/target/test-classes/StrStrTest.class
create mode 100644 leetcode/target/test-classes/SubsetsTest.class
create mode 100644 leetcode/target/test-classes/SubsetsWithDupTest.class
create mode 100644 leetcode/target/test-classes/SwapPairsTest.class
create mode 100644 leetcode/target/test-classes/ThreeSumClosestTest.class
create mode 100644 leetcode/target/test-classes/ThreeSumSmallerTest.class
create mode 100644 leetcode/target/test-classes/ThreeSumTest.class
create mode 100644 leetcode/target/test-classes/TrapTest.class
create mode 100644 leetcode/target/test-classes/ValidateStackSequencesTest.class
create mode 100644 leetcode/target/test-classes/ZigZagConvertTest.class
create mode 100644 offer/pom.xml
create mode 100644 offer/src/main/java/AddBinary.java
create mode 100644 offer/src/main/java/CheckInclusion.java
create mode 100644 offer/src/main/java/CheckInclusionII.java
create mode 100644 offer/src/main/java/CountBits.java
create mode 100644 offer/src/main/java/CountSubstrings.java
create mode 100644 offer/src/main/java/DetectCycle.java
create mode 100644 offer/src/main/java/Divide.java
create mode 100644 offer/src/main/java/FindAnagrams.java
create mode 100644 offer/src/main/java/FindMaxLength.java
create mode 100644 offer/src/main/java/IntersectionNode.java
create mode 100644 offer/src/main/java/IsPalindrome.java
create mode 100644 offer/src/main/java/LengthOfLongestSubstring.java
create mode 100644 offer/src/main/java/ListNode.java
create mode 100644 offer/src/main/java/MinSubArrayLength.java
create mode 100644 offer/src/main/java/MinWindow.java
create mode 100644 offer/src/main/java/NumMatrix.java
create mode 100644 offer/src/main/java/NumSubArrayProductLessThanK.java
create mode 100644 offer/src/main/java/PivotIndex.java
create mode 100644 offer/src/main/java/PivotIndexII.java
create mode 100644 offer/src/main/java/PivotIndexIII.java
create mode 100644 offer/src/main/java/RemoveNthFromEnd.java
create mode 100644 offer/src/main/java/RemoveNthFromEndII.java
create mode 100644 offer/src/main/java/SingleNumber.java
create mode 100644 offer/src/main/java/SubArraySum.java
create mode 100644 offer/src/main/java/ThreeSum.java
create mode 100644 offer/src/main/java/ThreeSumII.java
create mode 100644 offer/src/main/java/TwoIntegerDivide.java
create mode 100644 offer/src/main/java/TwoIntegerDivide2.java
create mode 100644 offer/src/main/java/TwoSum.java
create mode 100644 offer/src/main/java/ValidPalindrome.java
create mode 100644 offer/src/main/java/WordMaxProduct.java
create mode 100644 offer/src/test/java/AddBinaryTest.java
create mode 100644 offer/src/test/java/CheckInclusionIITest.java
create mode 100644 offer/src/test/java/CheckInclusionTest.java
create mode 100644 offer/src/test/java/CountBitsTest.java
create mode 100644 offer/src/test/java/CountSubstringsTest.java
create mode 100644 offer/src/test/java/DetectCycleTest.java
create mode 100644 offer/src/test/java/FindAnagramsTest.java
create mode 100644 offer/src/test/java/FindMaxLengthTest.java
create mode 100644 offer/src/test/java/IntersectionNodeTest.java
create mode 100644 offer/src/test/java/IsPalindromeTest.java
create mode 100644 offer/src/test/java/LengthOfLongestSubstringTest.java
create mode 100644 offer/src/test/java/MinSubArrayLengthTest.java
create mode 100644 offer/src/test/java/MinWindowTest.java
create mode 100644 offer/src/test/java/NumMatrixTest.java
create mode 100644 offer/src/test/java/NumSubArrayProductLessThanKTest.java
create mode 100644 offer/src/test/java/PivotIndexIIITest.java
create mode 100644 offer/src/test/java/PivotIndexIITest.java
create mode 100644 offer/src/test/java/PivotIndexTest.java
create mode 100644 offer/src/test/java/RemoveNthFromEndIITest.java
create mode 100644 offer/src/test/java/RemoveNthFromEndTest.java
create mode 100644 offer/src/test/java/SingleNumberTest.java
create mode 100644 offer/src/test/java/StringBuilderTest.java
create mode 100644 offer/src/test/java/SubArraySumTest.java
create mode 100644 offer/src/test/java/ThreeSumIITest.java
create mode 100644 offer/src/test/java/ThreeSumTest.java
create mode 100644 offer/src/test/java/TwoIntegerDivide2Test.java
create mode 100644 offer/src/test/java/TwoIntegerDivideTest.java
create mode 100644 offer/src/test/java/TwoSumTes.java
create mode 100644 offer/src/test/java/ValidPalindromeTest.java
create mode 100644 offer/src/test/java/WordMaxProductTest.java
create mode 100644 pom.xml
diff --git a/algorithm/pom.xml b/algorithm/pom.xml
new file mode 100644
index 0000000..629cdd0
--- /dev/null
+++ b/algorithm/pom.xml
@@ -0,0 +1,38 @@
+
+
+ 4.0.0
+
+ com.andy
+ leetcode
+ 1.0-SNAPSHOT
+
+
+ org.testng
+ testng
+ 7.6.1
+ test
+
+
+ JUNIT
+ JUNIT
+ 4.12
+ test
+
+
+ org.apache.commons
+ commons-lang3
+ 3.12.0
+ compile
+
+
+ JUNIT
+ JUNIT
+ 4.12
+ compile
+
+
+
+
+
\ No newline at end of file
diff --git a/algorithm/src/main/java/BFS_DFS/BinaryTreeLevelOrderTraversal.java b/algorithm/src/main/java/BFS_DFS/BinaryTreeLevelOrderTraversal.java
new file mode 100644
index 0000000..a6a5e2e
--- /dev/null
+++ b/algorithm/src/main/java/BFS_DFS/BinaryTreeLevelOrderTraversal.java
@@ -0,0 +1,49 @@
+package BFS_DFS;
+
+import binaryTree.TreeNode;
+
+import java.util.ArrayList;
+import java.util.LinkedList;
+import java.util.PriorityQueue;
+import java.util.Queue;
+
+/**
+ * 102. 二叉树层序遍历
+ */
+
+public class BinaryTreeLevelOrderTraversal {
+
+ public ArrayList> binaryTreeLevelOrderTraversal(TreeNode root) {
+ ArrayList> res = new ArrayList<>();
+
+ // 设置一个队列，队列中存放根节点
+ Queue queue = new LinkedList<>();
+ queue.offer(root);
+
+ while(!queue.isEmpty()) {
+ int size = queue.size();
+ // 将当前队列中的所有节点向四周扩散
+ ArrayList temp = new ArrayList<>();
+ for(int i=0; i> binaryTreeLevelOrderTraverseII(TreeNode root) {
+ ArrayList> res = new ArrayList<>();
+
+ Queue queue = new LinkedList<>();
+ queue.offer(root);
+
+ while(!queue.isEmpty()) {
+ int size = queue.size();
+ ArrayList temp = new ArrayList<>();
+
+ for(int i=0; i> binaryTreeZigzagLevelOrderTraversal(TreeNode root) {
+ ArrayList> res = new ArrayList<>();
+
+ if(root==null) {
+ return res;
+ }
+
+ Queue queue = new LinkedList<>();
+ queue.offer(root);
+ // 用于记录遍历方向
+ boolean leftToRight = false;
+ while(!queue.isEmpty()) {
+ int size = queue.size();
+
+ ArrayList temp = new ArrayList<>();
+
+ for(int i=0; i=grid.length || j>=grid[0].length) {
+ return;
+ }
+
+ if(grid[i][j]==0) {
+ return;
+ }
+
+ grid[i][j]=0;
+ dfs(i-1, j, grid);
+ dfs(i+1, j, grid);
+ dfs(i,j-1, grid);
+ dfs(i, j+1, grid);
+
+ }
+}
diff --git a/algorithm/src/main/java/BFS_DFS/MaxAreaIsland.java b/algorithm/src/main/java/BFS_DFS/MaxAreaIsland.java
new file mode 100644
index 0000000..5528dfc
--- /dev/null
+++ b/algorithm/src/main/java/BFS_DFS/MaxAreaIsland.java
@@ -0,0 +1,44 @@
+package BFS_DFS;
+
+/**
+ * 695 岛屿最大面积
+ */
+
+public class MaxAreaIsland {
+
+ int area = 0;
+
+ public int maxAreaIsland(int[][] grid) {
+ int res=0;
+ for(int i=0; i=grid.length || j>=grid[0].length) {
+ return;
+ }
+
+ if(grid[i][j]==0) {
+ return;
+ }
+
+ grid[i][j]=0;
+ area += 1;
+ dfs(i-1, j, grid);
+ dfs(i+1, j, grid);
+ dfs(i, j-1, grid);
+ dfs(i, j+1, grid);
+ }
+
+
+}
diff --git a/algorithm/src/main/java/BFS_DFS/MinimumDepthBinaryTree.java b/algorithm/src/main/java/BFS_DFS/MinimumDepthBinaryTree.java
new file mode 100644
index 0000000..0feea89
--- /dev/null
+++ b/algorithm/src/main/java/BFS_DFS/MinimumDepthBinaryTree.java
@@ -0,0 +1,40 @@
+package BFS_DFS;
+
+import binaryTree.TreeNode;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+/**
+ * 111. 二叉树的最小深度
+ */
+
+public class MinimumDepthBinaryTree {
+
+ public int minimumDepthBinaryTree(TreeNode root) {
+ int res = 0;
+
+ if(root==null) {
+ return res;
+ }
+
+ Queue queue = new LinkedList<>();
+ queue.offer(root);
+ res += 1;
+
+ while (!queue.isEmpty()) {
+ int sz = queue.size();
+
+ for(int i=0; i=grid.length || j>=grid[0].length) {
+ return;
+ }
+
+ // 海水
+ if(grid[i][j]==1) {
+ return;
+ }
+
+ grid[i][j]=1;
+ dfs(i-1, j, grid);
+ dfs(i+1, j, grid);
+ dfs(i, j-1, grid);
+ dfs(i, j+1, grid);
+ }
+}
diff --git a/algorithm/src/main/java/BFS_DFS/NumberDistinctIslands.java b/algorithm/src/main/java/BFS_DFS/NumberDistinctIslands.java
new file mode 100644
index 0000000..009716b
--- /dev/null
+++ b/algorithm/src/main/java/BFS_DFS/NumberDistinctIslands.java
@@ -0,0 +1,59 @@
+package BFS_DFS;
+
+import java.util.ArrayList;
+
+/**
+ * 694 不同的岛屿数量
+ */
+
+public class NumberDistinctIslands {
+
+ public int numberDistinctIslands(char[][] grid) {
+ int res = 0;
+ ArrayList shape = new ArrayList<>();
+ StringBuilder temp = new StringBuilder();
+ for(int i=0; i=grid.length || j>=grid[0].length) {
+ return;
+ }
+ if(grid[i][j]=='0') {
+ return;
+ }
+
+ // 记录外形
+ s.append(dir);
+
+ grid[i][j]='0';
+ dfs(i-1, j, grid, s, "1");
+ dfs(i+1, j, grid, s, "2");
+ dfs(i, j-1, grid, s, "3");
+ dfs(i, j+1, grid, s, "4");
+
+ }
+
+ boolean contain(String s, ArrayList shape) {
+ for(String t: shape) {
+ if(t.equals(s)) {
+ return true;
+ }
+ }
+ return false;
+ }
+
+}
diff --git a/algorithm/src/main/java/BFS_DFS/NumberEnclaves.java b/algorithm/src/main/java/BFS_DFS/NumberEnclaves.java
new file mode 100644
index 0000000..ef87c27
--- /dev/null
+++ b/algorithm/src/main/java/BFS_DFS/NumberEnclaves.java
@@ -0,0 +1,54 @@
+package BFS_DFS;
+
+/**
+ * 1020 飞地的数量
+ */
+
+public class NumberEnclaves {
+
+ int res = 0;
+
+ public int numberEnclaves(int[][] grid) {
+
+ int m=grid.length, n=grid[0].length;
+
+
+ for(int i=0; i=grid.length || j>=grid[0].length) {
+ return;
+ }
+
+ if(grid[i][j]==0) {
+ return;
+ }
+
+
+ grid[i][j] = 0;
+ res += 1;
+ dfs(i, j-1, grid); // 上
+ dfs(i, j+1, grid); // 下
+ dfs(i-1, j, grid); // 左
+ dfs(i+1, j, grid); // 右
+
+
+ }
+}
diff --git a/algorithm/src/main/java/BFS_DFS/NumberIslands.java b/algorithm/src/main/java/BFS_DFS/NumberIslands.java
new file mode 100644
index 0000000..1431bd5
--- /dev/null
+++ b/algorithm/src/main/java/BFS_DFS/NumberIslands.java
@@ -0,0 +1,41 @@
+package BFS_DFS;
+
+/**
+ * 200 岛屿数量
+ */
+
+public class NumberIslands {
+
+ public int numberIslands(char[][] grid) {
+ int res = 0;
+
+ for(int i=0; i=grid.length || j>=grid[0].length) {
+ return;
+ }
+
+ if(grid[i][j]=='0') {
+ return;
+ }
+
+ grid[i][j]='0';
+ dfs(i-1,j,grid);
+ dfs(i+1, j, grid);
+ dfs(i, j-1, grid);
+ dfs(i, j+1, grid);
+ }
+
+
+}
diff --git a/algorithm/src/main/java/BFS_DFS/OpenTheLock.java b/algorithm/src/main/java/BFS_DFS/OpenTheLock.java
new file mode 100644
index 0000000..a4782d9
--- /dev/null
+++ b/algorithm/src/main/java/BFS_DFS/OpenTheLock.java
@@ -0,0 +1,70 @@
+package BFS_DFS;
+
+import java.util.*;
+
+/**
+ * 752. 打开转盘锁
+ */
+
+public class OpenTheLock {
+
+ public int openTheLock(ArrayList depends, String target) {
+ int res = 0;
+ Queue queue = new LinkedList<>();
+ Set visited = new HashSet<>(depends);
+ queue.add("0000");
+
+ while (!queue.isEmpty()) {
+ int sz = queue.size();
+
+ for(int i=0; i queue = new LinkedList<>();
+ Set visited = new HashSet<>();
+ String target = "123450";
+ StringBuilder sb = new StringBuilder();
+ for(int i=0;i0) {
+ String sLeft = swap(cur, index, index-1);
+ queue.add(sLeft);
+ }
+ // 右交换
+ if(col0) {
+ String sTop = swap(cur, index, index-nums[0].length);
+ queue.add(sTop);
+ }
+
+ // 下交换
+ if(row=m || col>=n) {
+ // 超出搜索边界
+ return;
+ }
+
+ if(board[row][col]=='X') {
+ // 已经是海水
+ return;
+ }
+ // 将(row, col)变成海水，标记为 #
+ board[row][col] = '#';
+ // 淹没上下左右陆地
+ dfs(row+1, col, board);
+ dfs(row, col+1, board);
+ dfs(row-1, col, board);
+ dfs(row-1, col-1, board);
+ }
+
+
+
+
+}
diff --git a/algorithm/src/main/java/DP/BloodSimilarity.java b/algorithm/src/main/java/DP/BloodSimilarity.java
new file mode 100644
index 0000000..b34a4af
--- /dev/null
+++ b/algorithm/src/main/java/DP/BloodSimilarity.java
@@ -0,0 +1,42 @@
+package DP;
+
+import java.util.Scanner;
+
+/**
+ * 字节跳动 -- 古生物血缘远近判定
+ */
+
+public class BloodSimilarity {
+
+ public int bloodSimilarity(String str1, String str2){
+ int res = 0;
+
+ res = traverse(str1, 0, str2, 0, 0);
+ return res;
+ }
+
+ int traverse(String str1, int pos1, String str2, int pos2, int res){
+ if(pos1==str1.length()) {
+ return res+str2.length()-pos2;
+ }else if(pos2==str2.length()){
+ return res+str1.length()-pos1;
+ }
+
+ if(str1.charAt(pos1)==str2.charAt(pos2)) {
+ return traverse(str1, pos1+1, str2, pos2+1, res);
+ }
+
+ int res1 = traverse(str1, pos1+1, str2, pos2, res+1);
+ int res2 = traverse(str1, pos1, str2, pos2+1, res+1);
+ int res3 = traverse(str1, pos1+1, str2, pos2+1, res+1);
+ return Math.min(res1, Math.min(res2, res3));
+ }
+
+ public static void main(String[] args) {
+ Scanner sc = new Scanner(System.in);
+ String[] strs = sc.nextLine().trim().split(",");
+ BloodSimilarity solver = new BloodSimilarity();
+ int res = solver.bloodSimilarity(strs[0], strs[1]);
+ System.out.print(res);
+ }
+}
diff --git a/algorithm/src/main/java/DP/DisjointLines.java b/algorithm/src/main/java/DP/DisjointLines.java
new file mode 100644
index 0000000..873003a
--- /dev/null
+++ b/algorithm/src/main/java/DP/DisjointLines.java
@@ -0,0 +1,41 @@
+package DP;
+
+import java.util.Arrays;
+import java.util.HashMap;
+
+/**
+ * 1035 不相交的线
+ */
+
+public class DisjointLines {
+ public int maxUncrossedLines(int[] nums1, int[] nums2) {
+ int res=0;
+ int[][] memo = new int[nums1.length][nums2.length];
+ for(int[] ints: memo){
+ Arrays.fill(ints,-1);
+ }
+
+ res = dp(nums1, nums1.length-1, nums2, nums2.length-1, memo);
+ return res;
+ }
+
+ int dp(int[] nums1, int p1, int[] nums2, int p2, int[][] memo){
+ if(p1<0 || p2<0) {
+ return 0;
+ }
+
+ if(memo[p1][p2]!=-1) {
+ return memo[p1][p2];
+ }
+ if(nums1[p1]==nums2[p2]) {
+ memo[p1][p2] = dp(nums1, p1-1, nums2, p2-1, memo)+1;
+ }else {
+ memo[p1][p2] = Math.max(
+ dp(nums1, p1-1, nums2, p2, memo),
+ dp(nums1, p1, nums2, p2-1, memo)
+ );
+ }
+
+ return memo[p1][p2];
+ }
+}
diff --git a/algorithm/src/main/java/DP/Envelops.java b/algorithm/src/main/java/DP/Envelops.java
new file mode 100644
index 0000000..ceb488e
--- /dev/null
+++ b/algorithm/src/main/java/DP/Envelops.java
@@ -0,0 +1,28 @@
+package DP;
+
+import java.util.Arrays;
+import java.util.Comparator;
+
+/**
+ * 354. 俄罗斯套娃信封问题
+ *
+ * 思路：对信封进行排序。先比较width，width相同则比较height
+ */
+
+public class Envelops {
+
+ public int maxEnvelops(int[][] envelops) {
+ int res = 0;
+ // 对二维数组进行排序
+ Arrays.sort(envelops, new Comparator() {
+ public int compare(int[] a, int[] b) {
+ if(a[0]==b[0]) {
+ return a[1]-b[1];
+ }
+ return a[0]-b[0];
+ }
+ });
+
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/DP/IsSubsequence.java b/algorithm/src/main/java/DP/IsSubsequence.java
new file mode 100644
index 0000000..91a51eb
--- /dev/null
+++ b/algorithm/src/main/java/DP/IsSubsequence.java
@@ -0,0 +1,27 @@
+package DP;
+
+/**
+ * 392 判断子序列
+ */
+
+public class IsSubsequence {
+
+ public boolean isSubsequence(String s, String t) {
+ boolean res = true;
+ res = dp(s, s.length()-1, t, t.length()-1);
+ return res;
+ }
+
+ boolean dp(String s, int p1, String t, int p2){
+ if(p1<0){
+ return true;
+ }else if(p2<0){
+ return false;
+ }
+ if(s.charAt(p1)==t.charAt(p2)){
+ return dp(s, p1-1, t, p2-1);
+ }else {
+ return dp(s, p1, t, p2-1);
+ }
+ }
+}
\ No newline at end of file
diff --git a/algorithm/src/main/java/DP/LongestCommonSubsequence.java b/algorithm/src/main/java/DP/LongestCommonSubsequence.java
new file mode 100644
index 0000000..dd13986
--- /dev/null
+++ b/algorithm/src/main/java/DP/LongestCommonSubsequence.java
@@ -0,0 +1,25 @@
+package DP;
+
+/**
+ * 1143 最长公共子序列
+ */
+
+public class LongestCommonSubsequence {
+
+ public int longestCommonSubsequence(String text1, String text2){
+ int res = 0;
+ res = dp(text1, 0, text2, 0);
+
+ return res;
+ }
+
+ int dp(String text1, int p1, String text2, int p2){
+ if(p1>=text1.length() || p2>=text2.length()) {
+ return 0;
+ }
+ if(text1.charAt(p1)==text2.charAt(p2)){
+ return dp(text1, p1+1, text2, p2+1)+1;
+ }
+ return Math.max(dp(text1, p1+1, text2, p2), dp(text1, p1, text2, p2+1));
+ }
+}
diff --git a/algorithm/src/main/java/DP/LongestCommonSubsequenceII.java b/algorithm/src/main/java/DP/LongestCommonSubsequenceII.java
new file mode 100644
index 0000000..06dd809
--- /dev/null
+++ b/algorithm/src/main/java/DP/LongestCommonSubsequenceII.java
@@ -0,0 +1,40 @@
+package DP;
+
+import java.util.Arrays;
+
+/**
+ * 1143 最长公共子序列
+ */
+
+public class LongestCommonSubsequenceII {
+
+ public int longestCommonSubsequence(String text1, String text2){
+ int res = 0;
+ int[][] memo = new int[text1.length()][text2.length()];
+ for (int[] ints : memo) {
+ Arrays.fill(ints, -1);
+ }
+ res = dp(text1, text1.length()-1, text2, text2.length()-1, memo);
+
+ return res;
+ }
+
+ int dp(String text1, int p1, String text2, int p2, int[][] memo){
+ if(p1<0 || p2<0) {
+ return 0;
+ }
+ // 查询备忘录中是否存在数据
+ if(memo[p1][p2]!=-1){
+ return memo[p1][p2];
+ }
+
+ if(text1.charAt(p1)==text2.charAt(p2)){
+ memo[p1][p2] = dp(text1, p1-1, text2, p2-1, memo)+1;
+ }else {
+ memo[p1][p2] = Math.max(dp(text1, p1 - 1, text2, p2, memo),
+ dp(text1, p1, text2, p2 - 1, memo)
+ );
+ }
+ return memo[p1][p2];
+ }
+}
diff --git a/algorithm/src/main/java/DP/MinFallingPathSum.java b/algorithm/src/main/java/DP/MinFallingPathSum.java
new file mode 100644
index 0000000..d5ebe63
--- /dev/null
+++ b/algorithm/src/main/java/DP/MinFallingPathSum.java
@@ -0,0 +1,65 @@
+package DP;
+
+import java.util.Arrays;
+
+/**
+ * 931 最小下降和
+ */
+
+public class MinFallingPathSum {
+
+ public int minFallingPathSum(int[][] matrix) {
+ int res = Integer.MAX_VALUE;
+ int[][] memo = new int[matrix.length][matrix[0].length]; // 创建备忘录
+ for(int[] t: memo) {
+ Arrays.fill(t, Integer.MAX_VALUE);
+ }
+
+ dp(matrix.length-1, matrix[0].length-1, matrix, memo);
+ for(int i=0; i1) {
+ memo[row][i] = Math.min(dp(row - 1, i, matrix, memo), dp(row - 1, i + 1, matrix, memo))+matrix[row][i];
+ }else{
+ // 列数为1列
+ memo[row][i] = dp(row-1, i, matrix, memo)+ matrix[row][i];
+ }
+ }else if(i+1==matrix[0].length) {
+ // 最后一列（默认列数大于1）
+ memo[row][i] = Math.min(dp(row-1, i-1, matrix, memo), dp(row-1, i, matrix, memo))+matrix[row][i];
+ }else {
+ memo[row][i] = Math.min(
+ dp(row - 1, i - 1, matrix, memo),
+ Math.min(
+ dp(row - 1, i, matrix, memo),
+ dp(row - 1, i + 1, matrix, memo)
+ )
+ ) + matrix[row][i];
+ }
+
+ }
+ return memo[row][col];
+ }
+
+
+}
diff --git a/algorithm/src/main/java/DP/MinFallingPathSum2.java b/algorithm/src/main/java/DP/MinFallingPathSum2.java
new file mode 100644
index 0000000..bb6359b
--- /dev/null
+++ b/algorithm/src/main/java/DP/MinFallingPathSum2.java
@@ -0,0 +1,49 @@
+package DP;
+
+import java.util.Arrays;
+
+/**
+ * 1289. 下降路径最小和II
+ */
+
+public class MinFallingPathSum2 {
+ public int minFallingPathSum(int[][] grid) {
+ int res = Integer.MAX_VALUE;
+ int[][] memo = new int[grid.length][grid[0].length];
+ for(int[] t: memo) {
+ Arrays.fill(t, Integer.MAX_VALUE);
+ }
+ dp(grid.length-1, grid[0].length-1, grid, memo);
+ for(int i=0; i1 && i>0){
+ temp = Math.min(temp, dp(row-1, i-1, matrix, memo));
+ }
+ // 列数大于1，且未到达最右侧，那么比较
+ if(matrix[0].length>1 && i+1> triangle) {
+ int res = 0;
+ int[][] memo = new int[triangle.size()][triangle.size()];
+ for(int[] t: memo){
+ Arrays.fill(t, 666);
+ }
+
+// memo[0][0] = triangle.get(0).get(0);
+ res = dp(triangle.size()-1, triangle.size()-1, memo, triangle);
+ for(int i=0; i> triangle) {
+ if(row<0 || col<0) {
+ return 0;
+ }
+
+ if(memo[row][col]!=666) {
+ return memo[row][col];
+ }
+
+ for(int i=0; i<=row; i++) {
+ // 处于最左侧
+ if (i == 0) {
+ memo[row][i] = dp(row-1, i, memo, triangle)+triangle.get(row).get(i);
+ } else if (i == row) {
+ // 处于最右侧
+ memo[row][i] = dp(row - 1, i-1, memo, triangle) + triangle.get(row).get(i);
+ } else {
+ // 取最小值
+ memo[row][i] = Math.min(
+ dp(row - 1, i - 1, memo, triangle),
+ dp(row - 1, i, memo, triangle)
+ ) + triangle.get(row).get(i);
+ }
+ }
+ return memo[row][col];
+ }
+}
diff --git a/algorithm/src/main/java/DP/MinimumTriangleTotalII.java b/algorithm/src/main/java/DP/MinimumTriangleTotalII.java
new file mode 100644
index 0000000..f24663b
--- /dev/null
+++ b/algorithm/src/main/java/DP/MinimumTriangleTotalII.java
@@ -0,0 +1,47 @@
+package DP;
+
+import java.util.Arrays;
+import java.util.List;
+
+/**
+ * 120 三角形最小路径和（简化if判断语句）
+ */
+
+public class MinimumTriangleTotalII {
+ public int minimumTotal(List> triangle) {
+ int res = 0;
+ int[][] memo = new int[triangle.size()][triangle.size()];
+ for(int[] t: memo){
+ Arrays.fill(t, Integer.MAX_VALUE);
+ }
+
+ res = dp(triangle.size()-1, triangle.size()-1, memo, triangle);
+ for(int i=0; i> triangle) {
+ if(row<0 || col<0) {
+ return 0;
+ }
+
+ if(memo[row][col]!=Integer.MAX_VALUE) {
+ return memo[row][col];
+ }
+
+
+ for(int i=0; i<=row; i++) {
+ int temp = dp(row-1, i, memo, triangle);
+ if(i>0) {
+ temp = Math.min(temp, dp(row-1, i-1, memo, triangle));
+ }
+ if(i+1<=row) {
+ temp = Math.min(temp, dp(row-1, i, memo, triangle));
+ }
+ memo[row][i] = temp+triangle.get(row).get(i);
+ }
+ return memo[row][col];
+ }
+}
diff --git a/algorithm/src/main/java/DP/PalindromeList.java b/algorithm/src/main/java/DP/PalindromeList.java
new file mode 100644
index 0000000..3eea95c
--- /dev/null
+++ b/algorithm/src/main/java/DP/PalindromeList.java
@@ -0,0 +1,65 @@
+package DP;
+
+import linkedList.doublePointer.ListNode;
+
+/**
+ * 234. 回⽂链表
+ *
+ * 快慢指针
+ */
+
+
+public class PalindromeList {
+
+ public boolean palindrome(ListNode head) {
+ if(head==null) {
+ return true;
+ }
+ boolean res = true;
+ boolean even = false; // 默认为奇数
+
+ ListNode slow=head, fast=head;
+
+ // 首先获取中间节点，并判断个数的奇偶性
+ while(fast!=null && fast.next!=null) {
+ slow = slow.next;
+ if(fast.next.next==null) {
+ even = true;
+ }
+ fast = fast.next.next;
+ }
+
+ if(even) {
+ fast = slow;
+ }else {
+ fast = slow.next;
+ }
+
+ fast = reverse(fast);
+ slow = head;
+
+
+
+ // 判断是否为回文链表
+ while(fast!=null) {
+ if(slow.val!=fast.val) {
+ res = false;
+ break;
+ }
+ slow = slow.next;
+ fast = fast.next;
+ }
+
+ return res;
+ }
+
+ public ListNode reverse(ListNode head) {
+ if(head==null || head.next==null) {
+ return head;
+ }
+ ListNode last = reverse(head.next);
+ head.next.next = head;
+ head.next = null;
+ return last;
+ }
+}
diff --git a/algorithm/src/main/java/DP/ReverseNode.java b/algorithm/src/main/java/DP/ReverseNode.java
new file mode 100644
index 0000000..efd4b41
--- /dev/null
+++ b/algorithm/src/main/java/DP/ReverseNode.java
@@ -0,0 +1,18 @@
+package DP;
+
+// 反转链表
+
+import linkedList.doublePointer.ListNode;
+
+public class ReverseNode {
+
+ public ListNode reverseNode(ListNode list) {
+ if(list==null || list.next==null) {
+ return list;
+ }
+ ListNode last = reverseNode(list.next);
+ list.next.next = list;
+ list.next = null;
+ return last;
+ }
+}
diff --git a/algorithm/src/main/java/DP/ReverseNode2.java b/algorithm/src/main/java/DP/ReverseNode2.java
new file mode 100644
index 0000000..19702db
--- /dev/null
+++ b/algorithm/src/main/java/DP/ReverseNode2.java
@@ -0,0 +1,25 @@
+package DP;
+
+import linkedList.doublePointer.ListNode;
+
+/**
+ * 对题目 [206. 反转链表]的扩展
+ * 反转链表前N个节点
+ */
+
+public class ReverseNode2 {
+
+ ListNode successor = null; // 后驱节点
+
+ public ListNode reverseNode(ListNode list, int n) {
+ if(list==null || list.next==null || n<=1) {
+ successor = list.next;
+ return list;
+ }
+ ListNode last = reverseNode(list.next, n-1);
+ list.next.next = list;
+ list.next = successor;
+
+ return last;
+ }
+}
diff --git a/algorithm/src/main/java/DP/ReverseNode3.java b/algorithm/src/main/java/DP/ReverseNode3.java
new file mode 100644
index 0000000..1f8d57b
--- /dev/null
+++ b/algorithm/src/main/java/DP/ReverseNode3.java
@@ -0,0 +1,36 @@
+package DP;
+
+import linkedList.doublePointer.ListNode;
+
+public class ReverseNode3 {
+
+ private ListNode successor=null;
+
+ public ListNode reverseBetween(ListNode list, int m, int n) {
+ if(list==null || m<0 || n<0 || m>=n) {
+ return list;
+ }
+
+ ListNode p=list;
+ for(int i=0;i() {
+ @Override
+ public int compare(int[] o1, int[] o2) {
+ if(o1[0]==o2[0]) {
+ return o1[1]-o2[1];
+ }else {
+ return o2[1]-o1[1];
+ }
+ }
+ });
+
+// dp(envelopes.length-1, envelopes, memo);
+
+ return memo[envelopes.length-1];
+ }
+
+// int dp(int start, int[][] envelopes, int[] memo) {
+// if(start==0) {
+// return 1;
+// }
+//
+// if(envelopes[start][0]>envelopes[start-1][0] && envelopes[start][1]>envelopes[start-1][1]) {
+// if(memo[start-1]==0) {
+// memo[start-1] = dp(start-1, envelopes, memo);
+// }
+// memo[start]=memo[start-1]+1;
+// }else{
+//// dp
+// }
+// }
+
+
+}
diff --git a/algorithm/src/main/java/DP/UniquePathsWithObstacles.java b/algorithm/src/main/java/DP/UniquePathsWithObstacles.java
new file mode 100644
index 0000000..3f31ce9
--- /dev/null
+++ b/algorithm/src/main/java/DP/UniquePathsWithObstacles.java
@@ -0,0 +1,53 @@
+package DP;
+
+import java.util.Arrays;
+
+/**
+ * 63 不同路径II
+ */
+
+public class UniquePathsWithObstacles {
+ public int uniquePathsWithObstacles(int[][] obstacleGrid) {
+ int res = 0;
+ int[][] memo = new int[obstacleGrid.length][obstacleGrid[0].length];
+ for(int[] ints:memo) {
+ Arrays.fill(ints, -1);
+ }
+ if(obstacleGrid[0][0]==0) {
+ memo[0][0] = 1;
+ }else{
+ memo[0][0] = 0;
+ }
+// if(memo.length>1){
+// if(obstacleGrid[1][0]==0 && memo[0][0]==1) {
+// memo[1][0] = 1;
+// }else {
+// memo[1][0] = 0;
+// }
+// }
+// if(memo[0].length>1){
+// if(obstacleGrid[0][1]==0 && memo[0][0]==1) {
+// memo[0][1] = 1;
+// }else {
+// memo[0][1] = 0;
+// }
+// }
+ res = dp(memo.length-1, memo[0].length-1, memo, obstacleGrid);
+
+
+ return res;
+ }
+
+ int dp(int row, int col, int[][] memo, int[][] obs){
+ if(row<0 || col<0 || obs[row][col]==1) {
+ return 0;
+ }
+
+ if(memo[row][col]!=-1) {
+ return memo[row][col];
+ }
+
+ memo[row][col] = dp(row-1, col,memo, obs) + dp(row, col-1, memo, obs);
+ return memo[row][col];
+ }
+}
diff --git a/algorithm/src/main/java/alibaba/DuplicateLength.java b/algorithm/src/main/java/alibaba/DuplicateLength.java
new file mode 100644
index 0000000..003d282
--- /dev/null
+++ b/algorithm/src/main/java/alibaba/DuplicateLength.java
@@ -0,0 +1,30 @@
+package alibaba;
+
+import java.util.HashMap;
+
+public class DuplicateLength {
+
+ int duplicateLength(String str) {
+ int res = -1;
+
+ HashMap map = new HashMap<>();
+ int pos=0;
+
+ // 移动位置
+ while(pos {
+ p.printABC("B", 1);
+ });
+
+ Thread thread3 = new Thread(() -> {
+ p.printABC("C", 2);
+ });
+
+ thread1.start();
+ thread2.start();
+ thread3.start();
+ }
+}
\ No newline at end of file
diff --git a/algorithm/src/main/java/alibaba/ThreadPrintABC2.java b/algorithm/src/main/java/alibaba/ThreadPrintABC2.java
new file mode 100644
index 0000000..dc7e9fb
--- /dev/null
+++ b/algorithm/src/main/java/alibaba/ThreadPrintABC2.java
@@ -0,0 +1,48 @@
+package alibaba;
+
+import java.util.concurrent.locks.ReentrantLock;
+
+public class ThreadPrintABC2 {
+ int size;
+ int state;
+ int count;
+
+ ReentrantLock lock = new ReentrantLock();
+
+ public ThreadPrintABC2(int size, int group) {
+ this.size = size;
+ this.count = size*group;
+ }
+
+ public void printABC(String s, int nums, int val) {
+ while(state {
+ p.printABC("AA", 1, 0);
+ }).start();
+
+ new Thread(() -> {
+ p.printABC("BB", 2, 1);
+ }).start();
+
+ new Thread(() -> {
+ p.printABC("CC", 3, 2);
+ }).start();
+ }
+}
diff --git a/algorithm/src/main/java/alibaba/ThreadPrintCharNum.java b/algorithm/src/main/java/alibaba/ThreadPrintCharNum.java
new file mode 100644
index 0000000..15ec719
--- /dev/null
+++ b/algorithm/src/main/java/alibaba/ThreadPrintCharNum.java
@@ -0,0 +1,56 @@
+package alibaba;
+
+import java.util.concurrent.locks.ReentrantLock;
+
+public class ThreadPrintCharNum {
+ int size;
+ int count;
+ int state;
+ int n=1;
+ char c = 'A';
+ ReentrantLock lock = new ReentrantLock();
+
+ public ThreadPrintCharNum(int size, int group) {
+ this.size = size;
+ this.count = size*group;
+ }
+
+ public void printNum(int val) {
+ while (state
+ p.printNum(0)
+ ).start();
+
+
+ new Thread(() -> {
+ p.printChar(1);
+ }).start();
+
+ }
+}
diff --git a/algorithm/src/main/java/alibaba/ThreadPrintNums.java b/algorithm/src/main/java/alibaba/ThreadPrintNums.java
new file mode 100644
index 0000000..8506ee9
--- /dev/null
+++ b/algorithm/src/main/java/alibaba/ThreadPrintNums.java
@@ -0,0 +1,46 @@
+package alibaba;
+
+import java.util.concurrent.locks.ReentrantLock;
+
+public class ThreadPrintNums {
+ int size;
+ int state;
+ ReentrantLock lock = new ReentrantLock();
+
+ public ThreadPrintNums(int nums) {
+ this.size = size;
+ }
+
+ void printNum(int val) {
+ while (state <= 100) {
+ lock.lock();
+ if(state<=100 && state%2==val) {
+ System.out.println(state);
+ state += 1;
+ }
+ lock.unlock();
+ }
+ }
+
+
+ public static void main(String[] args) {
+ ThreadPrintNums p = new ThreadPrintNums(100);
+
+ // 打印奇数
+ new Thread(
+ () -> {
+ p.printNum(0);
+ }
+ ).start();
+
+ // 打印偶数
+ new Thread(
+ () -> {
+ p.printNum(1);
+ }
+ ).start();
+
+
+ }
+}
+
diff --git a/algorithm/src/main/java/array/binarySearch/EatBanana.java b/algorithm/src/main/java/array/binarySearch/EatBanana.java
new file mode 100644
index 0000000..8ed88e4
--- /dev/null
+++ b/algorithm/src/main/java/array/binarySearch/EatBanana.java
@@ -0,0 +1,55 @@
+package array.binarySearch;
+
+public class EatBanana {
+
+ public int eatBanana(int[] piles, int hour) {
+ if(piles.length==0) {
+ return -1;
+ }
+ if(piles.length==1) {
+ return (piles[0]+hour-1)/hour;
+ }
+
+ int sum = 0;
+ for(int t: piles) {
+ sum += t;
+ }
+
+ int left = sum/hour;
+ int right = sum;
+ while(left<=right) {
+ int mid = (left+right)>>1;
+ int h = calHour(piles, mid);
+ if(h==hour) {
+ left=mid;
+ break;
+ }else if(h0) {
+ if(calHour(piles, left-1)<=hour) {
+ left-=1;
+ }else {
+ break;
+ }
+ }
+
+ return left;
+ }
+
+ private int calHour(int[] piles, int speed) {
+ int hour = 0;
+ for(int i=0;i0) {
+ hour += 1;
+ }
+ }
+ return hour;
+ }
+}
diff --git a/algorithm/src/main/java/array/binarySearch/IsSubsequence.java b/algorithm/src/main/java/array/binarySearch/IsSubsequence.java
new file mode 100644
index 0000000..37bd4ba
--- /dev/null
+++ b/algorithm/src/main/java/array/binarySearch/IsSubsequence.java
@@ -0,0 +1,29 @@
+package array.binarySearch;
+
+/**
+ * 392.判断子序列
+ */
+
+public class IsSubsequence {
+
+ boolean isSubsequence(String s, String t) {
+
+ boolean res = false;
+
+ int left = 0;
+ int right = 0;
+ while (left> 1;
+// if(nums[mid]>1;
+ if(nums[mid]>1;
+ long sz = tailingZeros(mid);
+ if(sz==k) {
+ found = true;
+ break;
+ }else if(k>sz) {
+ left = mid+1;
+ }else {
+ right = mid;
+ }
+ }
+ if(found) {
+ res = 5;
+ }
+ return res;
+ }
+
+ private long tailingZeros(long n) {
+ long divisor=5;
+ long res=0;
+ while(n>=divisor) {
+ res += n/divisor;
+ divisor*=5;
+ }
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/array/binarySearch/SearchInsertPosition.java b/algorithm/src/main/java/array/binarySearch/SearchInsertPosition.java
new file mode 100644
index 0000000..1b01a13
--- /dev/null
+++ b/algorithm/src/main/java/array/binarySearch/SearchInsertPosition.java
@@ -0,0 +1,71 @@
+package array.binarySearch;
+
+/**
+ * 35. 搜索插⼊位置
+ */
+
+public class SearchInsertPosition {
+
+ /**
+ * 最初写法
+ */
+// public int searchInsert(int[] nums, int target) {
+// // 处理边界问题
+// if(nums.length==0 || nums[0]>target) {
+// return 0;
+// }
+// if(nums[nums.length-1]>1;
+// if(nums[mid]>target) {
+// high = mid-1;
+// }else if(nums[mid]0 && nums[mid-1]==target) {
+// mid--;
+// }
+// return mid;
+// }
+// }
+// return mid;
+// }
+
+ /**
+ * 按照模板写法
+ */
+ public int searchInsert(int[] nums, int target) {
+ // 对参数进行处理
+ if(nums.length==0 || nums[0]>target) {
+ return 0;
+ }
+ if(nums[nums.length-1]>1;
+ if(nums[mid]0 && nums[left-1]==target) {
+ left--;
+ }
+ return left;
+ }
+
+
+}
diff --git a/algorithm/src/main/java/array/binarySearch/SearchMatrix.java b/algorithm/src/main/java/array/binarySearch/SearchMatrix.java
new file mode 100644
index 0000000..44ff2c7
--- /dev/null
+++ b/algorithm/src/main/java/array/binarySearch/SearchMatrix.java
@@ -0,0 +1,88 @@
+package array.binarySearch;
+
+/**
+ * 74. 搜索⼆维矩阵
+ */
+
+public class SearchMatrix {
+
+ /**
+ * 最初算法
+ */
+// public boolean searchMatrix(int[][] nums, int target) {
+//
+// if(nums.length==0 || nums[0].length==0) {
+// return false;
+// }
+//
+// if(nums[0][0]>target || nums[nums.length-1][nums[0].length-1]>1;
+// int m = mid/N;
+// int n = mid%N;
+// if(nums[m][n]target) {
+// high = mid-1;
+// }else {
+// res = true;
+// break;
+// }
+// }
+// if(low==high && nums[low/N][low%N]==target) {
+// res = true;
+// }
+// return res;
+// }
+
+ /**
+ * 使用框架算法
+ */
+ public boolean searchMatrix(int[][] nums, int target) {
+
+ // 参数处理
+ if(nums.length==0 || nums[0].length==0) {
+ return false;
+ }
+ if(nums[0][0]>target || nums[nums.length-1][nums[0].length-1]>1;
+ int m = mid/N;
+ int n = mid%N;
+ if(nums[m][n]> 1;
+ if(nums[mid]>1;
+ if(nums[mid]target) {
+ high = mid-1;
+ }else {
+ // 找到目标值
+ int tLeft = mid;
+ int tRight = mid;
+ // 向左边遍历，取左边界
+ while(tLeft>0 && nums[tLeft-1]==target) {
+ tLeft--;
+ }
+
+ // 向右边遍历，取右边界
+ while(tRight+1> 1;
+ if (calDays(nums, mid)>days) {
+ left = mid+1;
+
+ }else {
+ right=mid;
+ }
+ }
+ return left;
+ }
+
+ private int calDays(int[] nums, int target) {
+ int index = 0;
+ int days = 0;
+
+ while (index < nums.length) {
+ int sum = 0;
+ while (index=m) {
+ res += n/m;
+ m*=5;
+ }
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/array/other/AdvantageShuffle.java b/algorithm/src/main/java/array/other/AdvantageShuffle.java
new file mode 100644
index 0000000..5028f5f
--- /dev/null
+++ b/algorithm/src/main/java/array/other/AdvantageShuffle.java
@@ -0,0 +1,49 @@
+package array.other;
+
+import java.util.*;
+
+/**
+ * 870 优势洗牌
+ */
+
+public class AdvantageShuffle {
+
+ public int[] advantageShuffle(int[] nums1, int[] nums2) {
+ int[] res = new int[nums1.length];
+ PriorityQueue> queue = new PriorityQueue<>(
+ (ArrayListt1, ArrayListt2) -> {
+ // 从大到小排序
+ return t2.get(1)-t1.get(1);
+ }
+ );
+ for(int i=0; i arr = new ArrayList<>();
+ arr.add(i);
+ arr.add(nums2[i]);
+ queue.add(arr);
+ }
+
+ Arrays.sort(nums1);
+
+ int left = 0, right = nums1.length-1;
+
+
+ while(left<=right) {
+ // 获取nums2的最大值
+ ArrayList arr = queue.poll();
+ assert arr != null;
+ int index = arr.get(0);
+ int value = arr.get(1);
+
+ if(nums1[right]>value) {
+ res[index] = nums1[right];
+ right--;
+ }else{
+ res[index] = nums1[left];
+ left++;
+ }
+ }
+
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/array/other/ContainerWithMostWater.java b/algorithm/src/main/java/array/other/ContainerWithMostWater.java
new file mode 100644
index 0000000..cf0b806
--- /dev/null
+++ b/algorithm/src/main/java/array/other/ContainerWithMostWater.java
@@ -0,0 +1,33 @@
+package array.other;
+
+/**
+ * 11 盛最多水的容器
+ */
+
+public class ContainerWithMostWater {
+
+ int containerWithMOstWater(int[] nums) {
+ int res = 0;
+ if(nums.length<2) {
+ return res;
+ }
+
+ int left=0, right=nums.length-1;
+ while (left> intervalListIntersections(int[][] nums1, int[][] nums2){
+ ArrayList> res = new ArrayList<>();
+ int left=0, right=0;
+ while (left arr = new ArrayList<>();
+ arr.add(leftBound);
+ arr.add(rightBound);
+ res.add(arr);
+ }
+ if(nums1[left][1]<= nums2[right][1]) {
+ left++;
+ } else if(nums1[left][1]> nums2[right][1]) {
+ right++;
+ }
+ }
+
+ return res;
+
+ }
+}
diff --git a/algorithm/src/main/java/array/other/MaxRepeatSubString.java b/algorithm/src/main/java/array/other/MaxRepeatSubString.java
new file mode 100644
index 0000000..7ab144f
--- /dev/null
+++ b/algorithm/src/main/java/array/other/MaxRepeatSubString.java
@@ -0,0 +1,33 @@
+package array.other;
+
+/**
+ * 1668 最大重复子字符串
+ */
+
+public class MaxRepeatSubString {
+ public int maxRepeating(String sequence, String word) {
+ int res = 0;
+ int pos=0, p1=0, p2=0;
+ while(pos=0) {
+ if(nums[i][j]==target) {
+ res = true;
+ break;
+ } else if(nums[i][j]>target) {
+ j--;
+ } else {
+ i++;
+ }
+
+ }
+ return res;
+
+ }
+}
diff --git a/algorithm/src/main/java/array/other/SquaresSortedArray.java b/algorithm/src/main/java/array/other/SquaresSortedArray.java
new file mode 100644
index 0000000..be52187
--- /dev/null
+++ b/algorithm/src/main/java/array/other/SquaresSortedArray.java
@@ -0,0 +1,27 @@
+package array.other;
+
+/**
+ * 977 有序数组的平方
+ */
+
+public class SquaresSortedArray {
+
+ int[] squaresSortedArray(int[] nums) {
+ int[] res = new int[nums.length];
+ int left=0, right=nums.length-1, index=nums.length-1;
+
+ while (left<=right){
+ if(Math.abs(nums[left])>Math.abs(nums[right])) {
+ res[index] = nums[left]*nums[left];
+ index--;
+ left++;
+ }else{
+ res[index] = nums[right]*nums[right];
+ index--;
+ right--;
+ }
+ }
+
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/array/other/TrappingRainWater.java b/algorithm/src/main/java/array/other/TrappingRainWater.java
new file mode 100644
index 0000000..ed02766
--- /dev/null
+++ b/algorithm/src/main/java/array/other/TrappingRainWater.java
@@ -0,0 +1,45 @@
+package array.other;
+
+import java.util.PriorityQueue;
+import java.util.Stack;
+
+/**
+ * 42 接雨水
+ */
+
+public class TrappingRainWater {
+
+ int trappingRainWater(int[] nums) {
+ int res = 0;
+ if(nums.length<2) {
+ return res;
+ }
+
+ int[] leftHeight = new int[nums.length];
+ int[] rightHeight = new int[nums.length];
+ for(int i=0;i=0;i--) {
+ if(i==nums.length-1) {
+ rightHeight[i] = nums[i];
+ } else {
+ rightHeight[i] = Math.max(nums[i], rightHeight[i+1]);
+ }
+ }
+
+ for(int i=0; i findAnagrams(String s, String p) {
+ HashMap map = new HashMap<>();
+ HashMap need = new HashMap<>();
+ int count=0;
+
+ // 对need进行初始化
+ for(int i=0;i res = new ArrayList<>();
+ int left = 0, right=0;
+ while(right=p.length()) {
+
+ // 进行窗口数据更新
+ if(count==p.length()) {
+ res.add(left);
+ }
+ char t = s.charAt(left);
+ if(map.get(t).equals(need.getOrDefault(t, 0))) {
+ count--;
+ }
+ map.replace(t, map.get(t)-1);
+ left++;
+ }
+
+ }
+
+ return res;
+ }
+
+}
diff --git a/algorithm/src/main/java/array/slideWindow/LengthOfLongestSubstring.java b/algorithm/src/main/java/array/slideWindow/LengthOfLongestSubstring.java
new file mode 100644
index 0000000..97a3401
--- /dev/null
+++ b/algorithm/src/main/java/array/slideWindow/LengthOfLongestSubstring.java
@@ -0,0 +1,30 @@
+package array.slideWindow;
+
+import java.util.HashMap;
+
+
+public class LengthOfLongestSubstring {
+
+ public int lengthOfLongestSubstring(String s) {
+ HashMap map = new HashMap();
+
+ int res=0;
+ int left=0, right=0;
+ while(right1) {
+ char temp = s.charAt(left);
+ map.replace(temp,map.get(temp)-1);
+ left++;
+ }
+ res = Math.max(res, right-left);
+ }
+
+ return res;
+
+ }
+}
diff --git a/algorithm/src/main/java/array/slideWindow/MinWindowSubstring.java b/algorithm/src/main/java/array/slideWindow/MinWindowSubstring.java
new file mode 100644
index 0000000..0b8be00
--- /dev/null
+++ b/algorithm/src/main/java/array/slideWindow/MinWindowSubstring.java
@@ -0,0 +1,57 @@
+package array.slideWindow;
+
+/**
+ * 76. 最⼩覆盖⼦串
+ */
+
+import java.util.HashMap;
+
+public class MinWindowSubstring {
+
+ public String minWindowSubstring(String s, String t) {
+ HashMap map = new HashMap<>();
+ HashMap need = new HashMap<>();
+
+ // 对参数进行处理
+ for(int i=0; i right-left) {
+ tleft = left;
+ tright = right;
+ }
+
+ char tt = s.charAt(left);
+ left++;
+ if(map.get(tt).equals(need.getOrDefault(tt,0))) {
+ count--;
+ }
+ map.replace(tt, map.get(tt)-1);
+ }
+ }
+
+ if(tleft<0) {
+ return "";
+ }else {
+ return s.substring(tleft, tright);
+ }
+ }
+}
diff --git a/algorithm/src/main/java/array/slideWindow/MinimumWindow.java b/algorithm/src/main/java/array/slideWindow/MinimumWindow.java
new file mode 100644
index 0000000..4863801
--- /dev/null
+++ b/algorithm/src/main/java/array/slideWindow/MinimumWindow.java
@@ -0,0 +1,60 @@
+package array.slideWindow;
+
+import java.util.LinkedList;
+
+// 这是对 [239. 滑动窗⼝最⼤值] 的改编，求最小值
+
+public class MinimumWindow {
+
+ // 使用单调队列求解，时间复杂度为O(N)
+ public int[] minimumWindow(int[] nums, int k) {
+ if (k < 1 || nums.length < k) {
+ return new int[]{};
+ }
+
+ MonotonicMinQueue window = new MonotonicMinQueue();
+ int[] res = new int[nums.length+1-k];
+
+ for(int i=0;i minq = new LinkedList();
+
+ public void push(int n) {
+ // 将大于 n 的元素全部删除(等于时保留)
+ while(!minq.isEmpty() && minq.getLast()>n) {
+ minq.pollLast();
+ }
+ // 然后将 n 加入尾部
+ minq.addLast(n);
+ }
+
+ public int min() {
+ return minq.getFirst();
+ }
+
+ // 若元素大于 队列头部元素，那么会在添加的时候自动删除
+ // 所以我们只需要判断是否为第一个元素，是的话才需要手动删除
+ public void pop(int n) {
+ if(n==minq.getFirst()) {
+ minq.pollFirst();
+ }
+ }
+}
diff --git a/algorithm/src/main/java/array/slideWindow/Permutation.java b/algorithm/src/main/java/array/slideWindow/Permutation.java
new file mode 100644
index 0000000..fc8a713
--- /dev/null
+++ b/algorithm/src/main/java/array/slideWindow/Permutation.java
@@ -0,0 +1,50 @@
+package array.slideWindow;
+
+import java.util.HashMap;
+
+/**
+ * 567. 字符串的排列
+ */
+
+public class Permutation {
+
+ public boolean permutation(String s1, String s2) {
+ HashMap map = new HashMap<>();
+ HashMap need = new HashMap<>();
+
+ int left=0, right=0;
+ int count=0;
+
+ // 参数初始化
+ for(int i=0; i=s1.length()) {
+ if(right-left==count) {
+ return true;
+ }
+
+ char t = s2.charAt(left);
+ if(map.get(t).equals(need.getOrDefault(t, 0))) {
+ count --;
+ }
+ map.replace(t, map.get(t)-1);
+ left++;
+
+ }
+ }
+ return false;
+
+ }
+}
diff --git a/algorithm/src/main/java/array/slideWindow/SlidingWindowMaximum.java b/algorithm/src/main/java/array/slideWindow/SlidingWindowMaximum.java
new file mode 100644
index 0000000..614e6e3
--- /dev/null
+++ b/algorithm/src/main/java/array/slideWindow/SlidingWindowMaximum.java
@@ -0,0 +1,84 @@
+package array.slideWindow;
+
+import java.util.*;
+
+/**
+ * 239. 滑动窗⼝最⼤值
+ */
+
+public class SlidingWindowMaximum {
+
+ // 两个循环，时间复杂度为O(kN)
+ public int[] maximumWindow(int[] nums, int k) {
+ // 参数处理
+ if(k<1 || nums.length maxq = new LinkedList();
+
+ public void push(int n) {
+ // 将小于 n 的元素全部删除(等于时保留)
+ while(!maxq.isEmpty() && maxq.getLast()> combinationSum(int[] candidates, int target) {
+ ArrayList> res = new ArrayList<>();
+
+ // 初始化值为false
+// boolean[] visited = new boolean[candidates.length];
+ ArrayList temp = new ArrayList<>();
+
+ backtrack(0, candidates, target, temp, res);
+
+ return res;
+ }
+
+ void backtrack(int start, int[] candidates, int target, ArrayList temp, ArrayList> res) {
+ if(target == 0) {
+ res.add(new ArrayList<>(temp));
+ return;
+ } else if(target < 0) {
+ return;
+ }
+
+ //从当前的位置往后遍历，可以排除例如[2,2,3]和[2,3,2]的情况，最终得到[2,2,3]
+ for(int i=start; i> combinations(int n, int k) {
+ ArrayList> res = new ArrayList<>();
+ ArrayList temp = new ArrayList<>();
+ boolean[] visited = new boolean[n];
+ int[] nums = new int[n];
+ for(int i=0;i temp, ArrayList> res) {
+ if(k==temp.size()) {
+ res.add(new ArrayList<>(temp));
+ }
+
+ for(int i=start;i generateParentheses(int n) {
+ ArrayList res = new ArrayList<>();
+ backtrack(n, n, new StringBuilder(), res);
+ return res;
+ }
+
+ void backtrack(int left, int right, StringBuilder s, ArrayListres) {
+ // 左括号数量小于右括号，表明括号不合法
+ if(left > right) {
+ return;
+ }
+ // 数量小于0，表示不合法
+ if(left < 0 || right < 0) {
+ return;
+ }
+ // 当所有的括号都恰好用完，表明合法
+ if(left==0 && right==0) {
+ res.add(new String(s));
+ return;
+ }
+
+ // 添加左括号
+ s.append('(');
+ backtrack(left-1, right, s, res);
+ // 撤销添加
+ s.deleteCharAt(s.length()-1);
+
+ // 添加右括号
+ s.append(')');
+ backtrack(left, right-1, s, res);
+ // 撤销添加
+ s.deleteCharAt(s.length()-1);
+
+
+
+ }
+
+
+}
diff --git a/algorithm/src/main/java/backTrack/MaximumDepthBinaryTree.java b/algorithm/src/main/java/backTrack/MaximumDepthBinaryTree.java
new file mode 100644
index 0000000..236f36c
--- /dev/null
+++ b/algorithm/src/main/java/backTrack/MaximumDepthBinaryTree.java
@@ -0,0 +1,22 @@
+package backTrack;
+
+/**
+ * 104 二叉树最大深度
+ */
+
+import java.util.ArrayList;
+
+public class MaximumDepthBinaryTree {
+
+ int maximumDepth(ArrayList nums) {
+ int res = 0;
+ backtrack();
+
+ return res;
+
+ }
+
+ public void backtrack() {
+
+ }
+}
diff --git a/algorithm/src/main/java/backTrack/NQueues.java b/algorithm/src/main/java/backTrack/NQueues.java
new file mode 100644
index 0000000..9087446
--- /dev/null
+++ b/algorithm/src/main/java/backTrack/NQueues.java
@@ -0,0 +1,77 @@
+package backTrack;
+
+/**
+ * 52 N-Queues
+ */
+
+import java.util.ArrayList;
+
+public class NQueues {
+
+ public ArrayList> nQueues(int n) {
+ ArrayList> res = new ArrayList<>();
+ char[][] board = new char[n][n];
+ for(int i=0; i> res) {
+ if(row==board.length) {
+ ArrayList temp = new ArrayList<>();
+ for(int i=0; i=0 && j=0 && j>=0; i--,j--) {
+ if(board[i][j]=='Q') {
+ return false;
+ }
+ }
+
+ return true;
+ }
+}
diff --git a/algorithm/src/main/java/backTrack/PartitionKEqualSumSubsets.java b/algorithm/src/main/java/backTrack/PartitionKEqualSumSubsets.java
new file mode 100644
index 0000000..25073d0
--- /dev/null
+++ b/algorithm/src/main/java/backTrack/PartitionKEqualSumSubsets.java
@@ -0,0 +1,53 @@
+package backTrack;
+
+/**
+ * 698 划分为k个相等的子集
+ */
+
+public class PartitionKEqualSumSubsets {
+
+ public boolean partitionKEqualSumSubsets(int[] nums, int k) {
+ int sum = 0;
+ for(int i=0; i 0) {
+ return false;
+ }
+
+ int target = sum /k;
+ boolean[] visited = new boolean[nums.length];
+
+ boolean res = backtrack(k, nums, 0, visited, target);
+
+ return res;
+ }
+
+ boolean backtrack(int k, int[] nums, int bucket, boolean[] visited, int target) {
+ if(k==0) {
+ return true;
+ }
+
+ //桶装满了，那么装下一个桶
+ if(bucket==target) {
+ return backtrack(k-1, nums, 0, visited, target);
+ }
+
+ for(int i=0; i> permutations(int[] nums) {
+ ArrayList> res = new ArrayList<>();
+ ArrayList temp = new ArrayList<>();
+ boolean[] visited = new boolean[nums.length];
+ backtrack(nums, visited, temp, res);
+ return res;
+ }
+
+ void backtrack(int[] nums, boolean[] visited, ArrayList temp, ArrayList> res) {
+ if(nums.length==temp.size()) {
+ res.add(new ArrayList<>(temp));
+ return;
+ }
+
+ for(int i=0; i> subsets(int[] nums) {
+ ArrayList> res = new ArrayList<>();
+ ArrayList temp = new ArrayList<>();
+ backtrack(0, nums, temp, res);
+
+ return res;
+ }
+
+ void backtrack(int start,int[] nums, ArrayList temp, ArrayList> res) {
+ res.add(new ArrayList<>(temp));
+
+ for(int i=start; i large = new PriorityQueue<>((a,b) -> {
+ return a-b;
+ });
+ int capacity;
+
+
+ public KthLargestData(int k, int[] nums) {
+ capacity = k;
+ for(int num : nums) {
+ this.add(num);
+ }
+ }
+
+ public int add(int val) {
+ large.add(val);
+ if(large.size()>capacity) {
+ large.poll();
+ }
+ return large.peek();
+ }
+}
diff --git a/algorithm/src/main/java/binaryHeap/KthLargestElement.java b/algorithm/src/main/java/binaryHeap/KthLargestElement.java
new file mode 100644
index 0000000..fd14eb2
--- /dev/null
+++ b/algorithm/src/main/java/binaryHeap/KthLargestElement.java
@@ -0,0 +1,44 @@
+package binaryHeap;
+
+import java.util.Comparator;
+import java.util.PriorityQueue;
+
+/**
+ * 215. 数组中的第K个最⼤元素
+ */
+
+public class KthLargestElement {
+
+ public int kthLargest(int[] nums, int k) {
+ int res = 0;
+
+// Comparator comparator = new Comparator() {
+// @Override
+// public int compare(Integer o1, Integer o2) {
+// return o1-o2; // 从小到大排序
+// }
+// };
+
+// PriorityQueue queue = new PriorityQueue<>(comparator);
+ // 等价于
+
+ // 从小到大排序
+ PriorityQueue queue = new PriorityQueue(
+ (o1, o2) -> {
+ return o1-o2;
+ }
+ );
+ for(int i=0;ik) {
+ queue.poll(); // 移除最上面的元素
+ }
+ }
+ res = queue.peek();
+
+
+ return res;
+ }
+
+
+}
diff --git a/algorithm/src/main/java/binaryHeap/MaxFrequency.java b/algorithm/src/main/java/binaryHeap/MaxFrequency.java
new file mode 100644
index 0000000..c3c8ecd
--- /dev/null
+++ b/algorithm/src/main/java/binaryHeap/MaxFrequency.java
@@ -0,0 +1,18 @@
+package binaryHeap;
+
+/**
+ * 895. 最⼤频率栈
+ * ======================== 未完成
+ */
+
+public class MaxFrequency {
+
+
+
+ public void push(int val) {
+ }
+
+ public int pop() {
+ return -1;
+ }
+}
diff --git a/algorithm/src/main/java/binaryHeap/MedianData.java b/algorithm/src/main/java/binaryHeap/MedianData.java
new file mode 100644
index 0000000..6ccd7bb
--- /dev/null
+++ b/algorithm/src/main/java/binaryHeap/MedianData.java
@@ -0,0 +1,49 @@
+package binaryHeap;
+
+/**
+ * 295 数据流中的中位数
+ */
+
+import java.util.PriorityQueue;
+
+public class MedianData {
+ // large的最小值 >= small的最大值
+ // 从小到大排序
+ private PriorityQueue large = new PriorityQueue<>((a, b) -> {
+ return a-b;
+ });
+ // 从大到小排序
+ private PriorityQueue small = new PriorityQueue<>((a, b) -> {
+ return b-a;
+ });
+
+ public void addNum(int num) {
+ // 先往small队列中存入值，然后将最大值传递给large队列
+ if(small.size()>large.size()) {
+ small.add(num);
+ Integer temp = small.poll();
+ large.add(temp);
+ } else {
+ large.add(num);
+ small.add(large.poll());
+ }
+
+ }
+
+ public double findMedian() {
+ // 判断数据小于2个的情况
+ if(small.isEmpty() && large.isEmpty()) {
+ return 0;
+ } else if(large.isEmpty()) {
+ return small.peek();
+ }
+ // 若small队列长度>大于large队列长度，那么small顶部就是中位数
+ if(small.size()==large.size()) {
+ return (small.peek()+large.peek())/2.0;
+ } else if(small.size() stack = new Stack<>();
+ // 从小到大排序
+ private Stack min = new Stack<>();
+
+ public MinStack() {
+
+ }
+
+ public void push(int val) {
+ stack.push(val);
+ if(min.isEmpty()) {
+ min.add(val);
+ } else if(min.peek()>val) {
+ min.add(val);
+ } else {
+ min.add(min.peek());
+ }
+ }
+
+ public void pop() {
+ stack.pop();
+ min.pop();
+ }
+
+ public int top() {
+ return stack.peek();
+ }
+
+ public int getMin() {
+ return min.peek();
+ }
+
+
+
+}
diff --git a/algorithm/src/main/java/binaryHeap/SeatReserve.java b/algorithm/src/main/java/binaryHeap/SeatReserve.java
new file mode 100644
index 0000000..4bc469b
--- /dev/null
+++ b/algorithm/src/main/java/binaryHeap/SeatReserve.java
@@ -0,0 +1,38 @@
+package binaryHeap;
+
+/**
+ * 1845. 座位预约管理系统
+ */
+
+import java.util.PriorityQueue;
+
+public class SeatReserve {
+
+ // 从小到大排序，表示可预订座位编号
+ private PriorityQueue queue = new PriorityQueue((a, b) -> {
+ return a-b;
+ });
+ private int num;
+
+ public SeatReserve(int n) {
+ num = n;
+ for(int i=0;i0) {
+ return queue.poll();
+ } else {
+ return -1;
+ }
+ }
+
+ public void unreserve(int seatNumber) {
+ if(queue.size() queue1 = new PriorityQueue(
+ (Task o1, Task o2) -> {
+ if(o1.start==o2.start) {
+ if(o1.cost==o2.cost) {
+ return o1.index-o2.index;
+ }else {
+ return o1.cost-o2.cost;
+ }
+ }else {
+ return o1.start - o2.start;
+ }
+ });
+ // 对任务执行时长、索引编号从小到大排序
+ PriorityQueue queue2 = new PriorityQueue<>(
+ (o1, o2) -> {
+ if(o1.cost==o2.cost) {
+ return o1.index-o2.index;
+ }else {
+ return o1.cost-o2.cost;
+ }
+ }
+ );
+
+ // 实例化Task
+ for(int i=0; i> binaryTreeLevelOrderTraversal(TreeNode root) {
+
+ ArrayList> res = new ArrayList<>();
+ traverse(root, 0, res);
+ return res;
+ }
+
+ void traverse(TreeNode root, int level, ArrayList> res) {
+ if(root==null) {
+ return;
+ }
+ if(level>=res.size()) {
+ res.add(new ArrayList<>());
+ }
+ res.get(level).add(root.val);
+
+ traverse(root.left, level+1, res);
+ traverse(root.right, level+1, res);
+ }
+}
diff --git a/algorithm/src/main/java/binaryTree/BinaryTreePostorderTraversal.java b/algorithm/src/main/java/binaryTree/BinaryTreePostorderTraversal.java
new file mode 100644
index 0000000..db81d07
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/BinaryTreePostorderTraversal.java
@@ -0,0 +1,28 @@
+package binaryTree;
+
+import java.util.LinkedList;
+
+/**
+ * 145 二叉树的后续遍历
+ */
+
+public class BinaryTreePostorderTraversal {
+ LinkedList binaryTreePostorderTraversal(TreeNode root) {
+ LinkedList res = new LinkedList<>();
+
+ traverse(root, res);
+
+ return res;
+ }
+
+ void traverse(TreeNode root, LinkedList res) {
+ if(root==null) {
+ return;
+ }
+ traverse(root.left, res);
+ traverse(root.right, res);
+ res.addFirst(root.val);
+ }
+
+
+}
diff --git a/algorithm/src/main/java/binaryTree/BinaryTreeZigzagLevelOrderTraversal.java b/algorithm/src/main/java/binaryTree/BinaryTreeZigzagLevelOrderTraversal.java
new file mode 100644
index 0000000..aa28cd8
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/BinaryTreeZigzagLevelOrderTraversal.java
@@ -0,0 +1,39 @@
+package binaryTree;
+
+/**
+ * [103. 二叉树的锯齿形层序遍历]
+ */
+
+import java.util.ArrayList;
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class BinaryTreeZigzagLevelOrderTraversal {
+
+ public LinkedList> zigzagOrder(TreeNode root) {
+ LinkedList> res = new LinkedList<>();
+
+ traverse(root, 0, res);
+ return res;
+ }
+
+ void traverse(TreeNode root, int level, LinkedList> res) {
+ if(root==null) {
+ return;
+ }
+ if(level>=res.size()) {
+// System.out.println(root.val);
+ res.add(new LinkedList<>());
+ }
+
+ // 偶数层从左到右，奇数层从右到左
+ if(level%2==1) {
+ res.get(level).addFirst(root.val);
+ }else {
+ res.get(level).add(root.val);
+ }
+
+ traverse(root.left, level+1, res);
+ traverse(root.right, level+1, res);
+ }
+}
diff --git a/algorithm/src/main/java/binaryTree/DiameterBinaryTree.java b/algorithm/src/main/java/binaryTree/DiameterBinaryTree.java
new file mode 100644
index 0000000..77359f3
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/DiameterBinaryTree.java
@@ -0,0 +1,24 @@
+package binaryTree;
+
+/**
+ * 543 二叉树的直径
+ */
+
+public class DiameterBinaryTree {
+
+ public int diameterBinaryTree(TreeNode root) {
+ int left = traverse(root.left);
+ int right = traverse(root.right);
+ return left+right;
+ }
+
+ int traverse(TreeNode root) {
+ if(root==null) {
+ return 0;
+ }
+
+ int left = traverse(root.left);
+ int right = traverse(root.right);
+ return 1+Math.max(left, right);
+ }
+}
diff --git a/algorithm/src/main/java/binaryTree/FlattenBinaryTreeToLinkedList.java b/algorithm/src/main/java/binaryTree/FlattenBinaryTreeToLinkedList.java
new file mode 100644
index 0000000..7c18871
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/FlattenBinaryTreeToLinkedList.java
@@ -0,0 +1,37 @@
+package binaryTree;
+
+import java.util.LinkedList;
+
+/**
+ * 114 二叉树展开为链表
+ */
+
+public class FlattenBinaryTreeToLinkedList {
+
+ LinkedList flattenBinaryTreeToLinkedList(TreeNode root) {
+ LinkedList res = new LinkedList<>();
+ traverse(root, res);
+ // 重新排列
+ for(int i=0; i res) {
+ if(root==null) {
+ return;
+ }
+// if(res.size()>0) {
+// TreeNode last = res.getLast();
+// last.left = null;
+// last.right = root;
+// }
+ res.add(root);
+ traverse(root.left, res);
+ traverse(root.right, res);
+
+ }
+}
diff --git a/algorithm/src/main/java/binaryTree/InorderTraversal.java b/algorithm/src/main/java/binaryTree/InorderTraversal.java
new file mode 100644
index 0000000..0e23281
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/InorderTraversal.java
@@ -0,0 +1,46 @@
+package binaryTree;
+
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * 94. ⼆叉树的中序遍历
+ */
+
+public class InorderTraversal {
+ /* 回溯算法思路*/
+ LinkedList res = new LinkedList<>();
+
+
+ // 中序遍历结果
+ public List inorderTraversal(TreeNode root) {
+ LinkedList res = new LinkedList<>();
+ if(root == null) {
+ return res;
+ }
+
+ res.addAll(inorderTraversal(root.left));
+ res.add(root.val);
+ res.addAll(inorderTraversal(root.right));
+ return res;
+ }
+
+ // 返回前序遍历结果
+ public List preorderTraversal(TreeNode root) {
+ traverse(root);
+ return res;
+ }
+
+ // 二叉树遍历函数
+ void traverse(TreeNode root) {
+ if(root == null) {
+ return;
+ }
+
+ traverse(root.left);
+ //中序遍历
+ res.add(root.val);
+ traverse(root.right);
+ }
+
+}
diff --git a/algorithm/src/main/java/binaryTree/InvertBinaryTree.java b/algorithm/src/main/java/binaryTree/InvertBinaryTree.java
new file mode 100644
index 0000000..b95c22e
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/InvertBinaryTree.java
@@ -0,0 +1,28 @@
+package binaryTree;
+
+/**
+ * 226 翻转二叉树
+ */
+
+public class InvertBinaryTree {
+
+ public void invertBinaryTree(TreeNode root) {
+ traverse(root);
+ }
+
+ void traverse(TreeNode root) {
+ if(root==null) {
+ return;
+ }
+
+
+ TreeNode temp = null;
+ temp = root.left;
+ root.left = root.right;
+ root.right = temp;
+
+ traverse(root.left);
+ traverse(root.right);
+
+ }
+}
diff --git a/algorithm/src/main/java/binaryTree/LevelOrderTraversal.java b/algorithm/src/main/java/binaryTree/LevelOrderTraversal.java
new file mode 100644
index 0000000..5bee268
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/LevelOrderTraversal.java
@@ -0,0 +1,45 @@
+package binaryTree;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+/**
+ * 102. ⼆叉树的层序遍历
+ */
+
+public class LevelOrderTraversal {
+
+
+
+ LinkedList> levelOrderTraversal(TreeNode root) {
+ LinkedList> res = new LinkedList<>();
+
+ if(root == null) {
+ return res;
+ }
+
+ Queue q = new LinkedList<>();
+ q.offer(root); // 添加二叉树
+ while(!q.isEmpty()) {
+ int sz = q.size();
+ // 记录下这一层节点值
+ LinkedList temp = new LinkedList<>();
+ // for循环控制每一层从左向右遍历
+ for(int i=0;i list = new LinkedList<>();
+ for(String t : str.split(",")) {
+ list.add(t);
+ }
+
+ TreeNode res = deserializeTraverse(list);
+
+ return res;
+ }
+
+ TreeNode deserializeTraverse(LinkedList list) {
+ // 采用后序遍历
+ if(list.isEmpty()) {
+ return null;
+ }
+
+ String first = list.removeFirst();
+ if(first.equals("null")) {
+ return null;
+ }
+
+ // 前序创建节点
+ int val = Integer.parseInt(first);
+
+ TreeNode root = new TreeNode(val);
+
+ //后续关联节点
+ root.left = deserializeTraverse(list);
+ root.right = deserializeTraverse(list);
+ return root;
+
+
+ }
+}
diff --git a/algorithm/src/main/java/binaryTree/TreeNode.java b/algorithm/src/main/java/binaryTree/TreeNode.java
new file mode 100644
index 0000000..632244d
--- /dev/null
+++ b/algorithm/src/main/java/binaryTree/TreeNode.java
@@ -0,0 +1,82 @@
+package binaryTree;
+
+import java.util.LinkedList;
+import java.util.List;
+import java.util.PriorityQueue;
+
+public class TreeNode {
+ public int val;
+ public TreeNode left;
+ public TreeNode right;
+
+ static LinkedList res = new LinkedList<>();
+
+ public TreeNode() {}
+
+ public TreeNode(int val) {
+ this.val = val;
+ }
+
+ public TreeNode(int val, TreeNode left, TreeNode right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+
+ public static LinkedList treeNodeToNum(TreeNode root) {
+ LinkedList list = new LinkedList<>();
+ preorderTraversal(root, list);
+ return list;
+ }
+
+ // 返回前序遍历结果
+ static void preorderTraversal(TreeNode root, LinkedList res) {
+ if(root==null) {
+ return;
+ }
+ res.add(root.val);
+ preorderTraversal(root.left, res);
+ preorderTraversal(root.right, res);
+ }
+
+ // 二叉树遍历函数
+ static void traverse(TreeNode root) {
+ if(root == null) {
+ return;
+ }
+
+ traverse(root.left);
+ //中序遍历
+ res.add(root.val);
+ traverse(root.right);
+ }
+
+ public static TreeNode numsToTreeNode (int[] nums) {
+ if(nums.length==0) {
+ return null;
+ }
+ LinkedList queue = new LinkedList<>();
+ TreeNode root = new TreeNode(nums[0]);
+ queue.add(root);
+
+ for(int index=1; index< nums.length;) {
+ int size = queue.size();
+ for(int i=0; i> zigzagOrder(TreeNode root) {
+ LinkedList> res = new LinkedList<>();
+ if (root == null) {
+ return res;
+ }
+
+ Queue q = new LinkedList<>();
+ boolean flag = false;
+ q.offer(root); // 添加
+
+ while (!q.isEmpty()) {
+ int sz = q.size();
+ LinkedList temp = new LinkedList<>();
+ for (int i = 0; i < sz; i++) {
+ TreeNode curr = q.poll(); // 弹出
+ if (!flag) {
+ temp.addFirst(curr.val);
+ }else {
+ temp.addLast(curr.val);
+ }
+ if(curr.left!=null){
+ q.offer(curr.left);
+ }
+ if(curr.right!=null){
+ q.offer(curr.right);
+ }
+ }
+ flag = !flag;
+ res.add(temp);
+ }
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/competition/AverageValue.java b/algorithm/src/main/java/competition/AverageValue.java
new file mode 100644
index 0000000..b756dba
--- /dev/null
+++ b/algorithm/src/main/java/competition/AverageValue.java
@@ -0,0 +1,22 @@
+package competition;
+
+/**
+ * 2455 可被三整除的偶数的平均值
+ */
+
+public class AverageValue {
+ public int averageValue(int[] nums) {
+ int res = 0;
+ int count = 0;
+ for(int n: nums) {
+ if(n%6==0) {
+ res+=n;
+ count++;
+ }
+ }
+ if(count>0) {
+ res = res/count;
+ }
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/dataStructureDesign/InsertDeleteGetRandom.java b/algorithm/src/main/java/dataStructureDesign/InsertDeleteGetRandom.java
new file mode 100644
index 0000000..53b5cca
--- /dev/null
+++ b/algorithm/src/main/java/dataStructureDesign/InsertDeleteGetRandom.java
@@ -0,0 +1,39 @@
+package dataStructureDesign;
+
+
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.Random;
+
+/**
+ * 380 O(1)时间插入、删除、获取随机元素
+ */
+
+public class InsertDeleteGetRandom {
+
+ ArrayList data = new ArrayList<>();
+
+ boolean insert(int val) {
+ if(data.contains(val)) {
+ return false;
+ }else {
+ data.add(val);
+ return true;
+ }
+ }
+
+ boolean remove(int val) {
+ if(data.contains(val)) {
+ // 若不转换成对象，那么默认按照索引删除
+ data.remove((Integer) val);
+ return true;
+ }else {
+ return false;
+ }
+ }
+
+ int getRandom() {
+ int index = new Random().nextInt()%data.size();
+ return data.get(index);
+ }
+}
diff --git a/algorithm/src/main/java/dataStructureDesign/LFUCache.java b/algorithm/src/main/java/dataStructureDesign/LFUCache.java
new file mode 100644
index 0000000..5641852
--- /dev/null
+++ b/algorithm/src/main/java/dataStructureDesign/LFUCache.java
@@ -0,0 +1,86 @@
+package dataStructureDesign;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.PriorityQueue;
+
+/**
+ * 460 LFU缓存
+ */
+
+class LFUNode {
+ int index;
+ int key;
+ int val;
+ int count;
+
+ public LFUNode(int index, int key, int val) {
+ this.index = index;
+ this.key = key;
+ this.val = val;
+ this.count = 0;
+ }
+
+ public void increase() {
+ count++;
+ }
+}
+
+public class LFUCache {
+ int capacity;
+ int index = 0;
+ HashMap map = new HashMap<>();
+
+ // 按照访问次数、存放时间从小到大排序、
+ PriorityQueue queue = new PriorityQueue<>(
+ (o1, o2) -> {
+ if(o1.count==o2.count) {
+ return o1.index - o2.index;
+ }else {
+ return o1.count - o2.count;
+ }
+ }
+ );
+
+
+ public LFUCache(int capacity) {
+ this.capacity = capacity;
+ }
+
+ int get(int key) {
+ if(map.containsKey(key)) {
+ LFUNode temp = map.get(key);
+ // 更新访问次数
+ temp.increase();
+ // 更新索引编号
+ temp.index = index;
+ index++;
+ return temp.val;
+ }
+ return -1;
+ }
+
+ void put(int key, int val) {
+ if(map.containsKey(key)) {
+ // 更新数据
+ LFUNode data = map.get(key);
+ data.val = val;
+ data.increase();
+ data.index = index;
+ index++;
+ } else {
+ // 判断是否超过缓存
+ if(map.size()>=capacity) {
+
+ LFUNode d = queue.poll();
+ d.count = 0;
+ map.remove(d.key);
+ }
+
+ LFUNode temp = new LFUNode(index, key, val);
+ map.put(key, temp);
+ queue.add(temp);
+ index++;
+ }
+ }
+}
diff --git a/algorithm/src/main/java/dataStructureDesign/LRUCache.java b/algorithm/src/main/java/dataStructureDesign/LRUCache.java
new file mode 100644
index 0000000..c3a498f
--- /dev/null
+++ b/algorithm/src/main/java/dataStructureDesign/LRUCache.java
@@ -0,0 +1,86 @@
+package dataStructureDesign;
+
+import linkedList.doublePointer.ListNode;
+import org.w3c.dom.NodeList;
+
+/**
+ * 146 LRU 缓存机制
+ */
+
+
+class Node {
+ int key;
+ int val;
+ Node next;
+ public Node(int key, int val) {
+ this.key = key;
+ this.val = val;
+ }
+}
+
+// 使用单链表来处理
+public class LRUCache {
+
+ private int capacity;
+ private int size = 0;
+ Node dummy = new Node(-1, -1);
+
+ public LRUCache(int capacity) {
+ this.capacity = capacity;
+ }
+
+ public int get(int key) {
+ Node pre = dummy;
+ Node cur = pre.next;
+ while (cur!=null) {
+ if(cur.key==key) {
+ moveCurrentNode(pre, cur);
+ return cur.val;
+ }
+ pre = pre.next;
+ cur = pre.next;
+ }
+ return -1;
+
+ }
+
+ public void put(int key, int value) {
+
+ Node pre =dummy;
+ Node cur = dummy.next;
+
+ // 先遍历，数据是否存在
+ while (cur!=null) {
+ if(cur.key==key) {
+ cur.val = value;
+ moveCurrentNode(pre, cur);
+ return;
+ }
+ cur = cur.next;
+ // 保留倒数第二个节点
+ if(cur!=null) {
+ pre = pre.next;
+ }
+ }
+
+ // 若数据不存在，那么添加数据
+ Node head = dummy.next;
+ dummy.next = new Node(key, value);
+ dummy.next.next = head;
+ // 节点数自增1
+ size++;
+ if(size>capacity) {
+ pre.next = null;
+ size = capacity;
+ }
+
+ }
+
+ void moveCurrentNode(Node pre, Node cur) {
+ pre.next = cur.next;
+ cur.next = dummy.next;
+ dummy.next = cur;
+ }
+
+
+}
diff --git a/algorithm/src/main/java/dataStructureDesign/LRUCache2.java b/algorithm/src/main/java/dataStructureDesign/LRUCache2.java
new file mode 100644
index 0000000..0c35cbe
--- /dev/null
+++ b/algorithm/src/main/java/dataStructureDesign/LRUCache2.java
@@ -0,0 +1,54 @@
+package dataStructureDesign;
+
+import java.util.LinkedHashMap;
+
+/**
+ * 146 LRU 缓存机制
+ */
+
+
+// 使用LinkedHashMap双链表来处理
+
+public class LRUCache2 {
+
+ private int capacity;
+ LinkedHashMap map = new LinkedHashMap<>();
+
+ public LRUCache2(int capacity) {
+ this.capacity = capacity;
+ }
+
+ public int get(int key) {
+ if(map.containsKey(key)) {
+ int value = map.get(key);
+ moveHead(key);
+ return value;
+ }
+ return -1;
+ }
+
+ public void put(int key, int value) {
+ if(map.containsKey(key)) {
+ map.replace(key, value);
+ } else {
+ map.put(key, value);
+ }
+
+ if(map.size()>capacity) {
+ int removeKey = map.keySet().iterator().next();
+ map.remove(removeKey);
+ }
+
+
+ }
+
+ void moveHead(int key) {
+ int value = map.get(key);
+ // 删除元素
+ map.remove(key);
+ // 添加到队尾
+ map.put(key, value);
+ }
+
+
+}
diff --git a/algorithm/src/main/java/dataStructureDesign/MaximumFrequencyStack.java b/algorithm/src/main/java/dataStructureDesign/MaximumFrequencyStack.java
new file mode 100644
index 0000000..200e28c
--- /dev/null
+++ b/algorithm/src/main/java/dataStructureDesign/MaximumFrequencyStack.java
@@ -0,0 +1,48 @@
+package dataStructureDesign;
+
+import java.util.HashMap;
+import java.util.PriorityQueue;
+import java.util.Stack;
+
+/**
+ * 895 最大频率栈
+ */
+
+
+public class MaximumFrequencyStack {
+
+ // 当前最大频率
+ int maxFre = 0;
+
+ // 数值与频率的映射表
+ HashMap valToFre = new HashMap<>();
+ // 频率与数值的映射表
+ HashMap> freToVal = new HashMap>();
+
+
+ public void push(int val) {
+ // 修改 VF 表：val 对应的 freq 加⼀
+ int fre = valToFre.getOrDefault(val, 0) + 1;
+ valToFre.put(val, fre);
+ // 修改 FV 表：在 freq 对应的列表加上 val
+ freToVal.putIfAbsent(fre, new Stack<>());
+ freToVal.get(fre).push(val);
+ // 更新 maxFreq
+ maxFre = Math.max(maxFre, fre);
+
+ }
+
+ public int pop() {
+ Stack vals = freToVal.get(maxFre);
+ int v = vals.pop();
+ valToFre.replace(v, maxFre-1);
+ if(vals.isEmpty()) {
+ maxFre--;
+ freToVal.remove(maxFre);
+ }
+ return v;
+ }
+
+}
+
+
diff --git a/algorithm/src/main/java/dataStructureDesign/MinStack.java b/algorithm/src/main/java/dataStructureDesign/MinStack.java
new file mode 100644
index 0000000..abd5fb0
--- /dev/null
+++ b/algorithm/src/main/java/dataStructureDesign/MinStack.java
@@ -0,0 +1,36 @@
+package dataStructureDesign;
+
+import java.util.Stack;
+
+/**
+ * 155 最小栈
+ */
+
+public class MinStack {
+
+ Stack stack1 = new Stack<>();
+ Stack stack2 = new Stack<>();
+
+ void push(int val) {
+ if(stack1.isEmpty()) {
+ stack2.push(val);
+ }else {
+ int minVal = Math.min(stack2.peek(), val);
+ stack2.push(minVal);
+ }
+ stack1.push(val);
+ }
+
+ void pop() {
+ stack1.pop();
+ stack2.pop();
+ }
+
+ int top() {
+ return stack1.peek();
+ }
+
+ int getMin() {
+ return stack2.peek();
+ }
+}
diff --git a/algorithm/src/main/java/differenceArray/CarPooling.java b/algorithm/src/main/java/differenceArray/CarPooling.java
new file mode 100644
index 0000000..c417772
--- /dev/null
+++ b/algorithm/src/main/java/differenceArray/CarPooling.java
@@ -0,0 +1,38 @@
+package differenceArray;
+
+/**
+ * 1094. 拼车
+ * 公交站台数量不多于1000个
+ */
+
+public class CarPooling {
+
+ public boolean carPooling(int[][] trips, int capacity) {
+ if(trips.length==0) {
+ return true;
+ }
+ boolean res = true;
+
+ // 初始化差分数组
+ int[] diff = new int[1001];
+
+ // 对差分数组进行操作
+ for(int i=0;icapacity) {
+ res = false;
+ break;
+ }
+ }
+ return res;
+ }
+}
diff --git a/algorithm/src/main/java/differenceArray/FlightBooking.java b/algorithm/src/main/java/differenceArray/FlightBooking.java
new file mode 100644
index 0000000..830e398
--- /dev/null
+++ b/algorithm/src/main/java/differenceArray/FlightBooking.java
@@ -0,0 +1,32 @@
+package differenceArray;
+
+/**
+ * 1109. 航班预订统计
+ */
+
+public class FlightBooking {
+
+ int[] flightBooking(int[][] bookings, int n) {
+
+ int[] diff = new int[n];
+
+ // 初始化差分数组
+ for(int i=0;i> res = new LinkedList<>();
+
+ public List> allPathResourceTarget(int[][] graph) {
+ LinkedList path = new LinkedList<>();
+ traverse(graph, 0, path);
+ return res;
+
+ }
+
+ // 图的遍历框架
+ private void traverse(int[][] graph, int s, LinkedList path) {
+
+ // 添加节点 s 到路径
+ path.addLast(s);
+
+ int n = graph.length;
+ if(s == n-1) {
+ // 到达终点
+ res.add(new LinkedList<>(path));
+ path.removeLast();
+ return;
+ }
+
+ // 递归每个相邻节点
+ for(int v: graph[s]) {
+ traverse(graph, v, path);
+ }
+
+ // 从路径移除节点 s
+ path.removeLast();
+ }
+
+}
diff --git a/algorithm/src/main/java/images/binary-tree-traversal.jpg b/algorithm/src/main/java/images/binary-tree-traversal.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..d5ec630b811f13e4baa193936ebe78a0066b33bc
GIT binary patch
literal 254010
zcmYg%cRXBO*S3}*h?Wr1M~@bg=)HGAbYnypy%RmS`JzJB2Xb^A-?W6N
zeiG2Z^xoB>@q<%v-}?e#fA(!|%}-9;JM|?LpqlW2&#+Jf3h27uQKcEm^PjK(w$*@Z
zTxn34e}4X-HaF02Yo~Z*QStxjRH+f~`Ty^snjlVOE!`A`1C_{G2D`H#WYxJfz8`2TH@`t6!`o~--7V}$10waLYK
ze(3u@2BFbu=l``8q`Y{d8Oq@s@ZUi`z^~R{mgfH7M^{Z~47#F0J%SOp{MWdra~pe{
z@WZ4Vz5g|a>F!{Bf1ZJtqyK-JIvEqslmAa2wJt`;dAC{kf6a;CH(Z9*J#7``TKM0&
ztOi(vIs5yUnX_#<83m+tbNc{1Id**raHqrYR@gL&jC}wxH-YeVEE8l9r&wwpAEfG
zZ@`L}yTAt0rF>gTvcCIXyYb`luEvLw@lU}+YsCxIh~bbHy@W~QsYfmgCo|Ij%zoU#
zB^zA9Ui9x2(!o~!vXEWPXI%-idL0NO%&7=YN+faFjn9
zXeyN=*~@&P{O)7FDM^1h)|bC3z9|hUcfkcjO?g`qj=#X3Z`Hv35n-0oQrjDQq=)&}
z^;c|>0VEsdB!g{(4xsZ-NEs|&W}bXcIyswOJ=GH(*N_hT!#jPea`2cpXZ|he^luq7
z6F}q~K+gaK0{xuJTUgBV88x!Yz=0BUgEg=X@g%W8Hl6Kcs@tlM`&1#f@f*RsL$}J7jR!q}}ymE>x?
z0>@0Mi9Sy5eg^gUHgNbO1hj2bEGu7
z?w|M1mS@FZDb&@=USt+lncTL@e0DTWL-XgQ1N_0rZ(`DoqGPb)>8)%*H
z7xcxtDC7w+H$=tJS39mDR&Z_2}Tmm2ToHdJcGn2zYR;ng;MYQ^cjT{dxSy~YuU9S0bnhjFL9h-hTt
zF*N%#F};x-SY+m^ZsGyfCwl_i`k|HyUMi@OzJkKA@(Ws7K_Dl^1?o-O2G2gPzOg@p
zRj*t!PicQ;H;g&3-hAf4)^Na<2&>YXzu`KLZ&rzc>s@Evwq5rHO?=KSW0d&l7MIKt
z$dG?kqeYJp{n_Aibqv#9@BEFW=Qzb#34*O1BLS4v@?Ij@D*DH0B0J)}d@#7?O2*LvBk8%kO!j4Nwsf
zya}@Kj=tuR*ANOZ_`M-pys>-$NYmmB&EG5jSYbBZiLFN#4jv#)PraY%<4K4
z6-4v#j|=nfej}%e(V)*v(>(C)TLhUQGf`VqiJMurHWl5X2FaJNJUcB}xYQ+*=($4P
zZJ7gy8(zpSi~3{Bb{%S%EFim=e+PWpUts<&JDgSu1)g10*>^L)F@jnOd;s(b22QrA
z7Vhhz&}M+(U+%yB!iVca#>4^d3LipY1IT@sc5x=EoBj??qh4eDG&wq3Yf%B_nbp4u
zP3%+`NMWXZ?03iT9qpSq5TeO`MbaHCb4E%%bdoDT|D6$U%VhqrNvHO(6YU|(1{H?)
zta&oKT)kcm*I>KZOR=faeD520gG?P+r^%c@4#)&zjf$EY8YKBI2IhU?$V$0chy5!U
z|1b56;6C?XP%wrNuqy929df;PsQum*|Ht!>1=xJ=rPtsE>x=&h22~SG@ug$W^~$`a
zMMyjAQ`JwijI08>Kb!dcRJlI%7Q&9vTLsKRtWMEnR_Ig4{HYqk(I2OiLLrkyLQRJN
z%H;*IpKJ63jr4DWrc3O9UpB6quIAhC`u3l3X7b5D0VLY(d5h51jqcnL2rx2bFnFH0
zPNI8Ah1ynL=KA5@@ZtG*+jLaZ){e?CyFq}5{7s;?Tv#SD{_CeMH~Wi5#j|yj#4mJA
zEz-h=_CB99=uhyKRlgIoh`Z)#j2}G4TE1JWj^K63yZOW)DPZV%HK^ZWx+mGS#v+4s
z5QBG+xP>ja<Yz^m2Sm`!^mk6C|$L
z9DSdgm?3i?zX2KmuoUZsGFC*`j%dB_>O|hQrbs6}5*;8h@R8ixHXlV7_hHpZFurIL
zf=eiuaUsR90qv~+*e*(ChU_v{*`uxWo!MTcV6)e|Znv7&cU%9WP{4Cs%q|hY5wdEjx$UEfxnR+HT*j0Xb
zPFWs9^xluR*!<|;q5ivG?RXMHk;ynAWbT
zJ_y0d%qX|I^FUbmgvQ%_vhrJ)ex@b%nW^X!seW%XZZ}3KmfV=t{>rlo&n}nN;FTqH
zY)njprGPL}p9(6>aFuVrIE%4LV7bUHo&q?P*S|u~Z6nUjWcs3f}`t=^0iim&si?B{_Ap%zNqQOc0520e(rH4;oYGl$-T#yvgw3GbSd=Rg;%Fy1OK4ve4sw>*accMIs
zS0?!)Ht?Am4(uv@sCg<{^B*3XV6#CD3h;kapc%L|HFdlO*{ysA^r+{)^rjG!KC5b^
z6SL-AR>o^)kpX{34k4!3RB3{;k}@aGMY9!C1CX*yQ&!79WF9`#vv*r||K_0*RA|
zYQ}I-(9^-x`_$QU3H)}Z)=M>8&Y7?)EmP4`hMOSyQXK{NtdLb{jPxFFmQNm3*40ko
zu>!^&OI?w~%yePi^!esRh7HFVrm;gxqrJN0&LV9MEWaRZ*o4NMM4&9qZuhSRC!cPA
zyo?H2+~|^VfE+fT&K4*;Mf&=$$Z4&e$6&SUDRJ}M;m(zkmMHKYOe-?{ncVWR`^aIp
zh)(omf5|0B0kS%=cx=5__SzpLOlR3zZ9jK8HNF>UhKMd^V8)jOW-KDA3+!>JIr=>R
za8#<>urkNYWm0tb3tcum->yp`(@uDyhwSt|csaW<&of}Vz>#5S$cC&$7&g%1)H1gl
zVio4sj#^SA5(~(bSIO`d7d(PVeQ>LX5UGw^yn9wU8woBD2A$v9Ip=alZn!Pf6SbSxs}-X?qIqH8QCPU*-)
zz-wjJ%t{$6@P(}k&h|pNjdgY=oeO&$FNX@6QzB0!SvA>ErAh5SzX$m^GJK&LVJ{SZ
zM3mWn=9US1u2tJMav50eQyaKr!+d&^YKpyRfk;=3!--wjnXq9+MCj
z=NyJyfPff`59QULnaI}0)#^({pB0RRPhj58N_YQ^iwYfTAW?GDE
zU)vcnnSrZ?W6A?oS#Vj1z;2&?J95(dlM}gX^4v-xTxrj!o24`y&3dE#Bx)hKF5s*n
z{eJ{510w0X^T!vJ)M*#p_r-caH^$TpgF@o)QCd_CDJx&lqP~#4QtA)xvGZW*<<3A$
zIU8!?&Oqlnl}2nYEX(~bHWzZospnblQd+81$md&`r3I}-)QO_hMZ0x*$wl9l
zqsw2ZG`X3%yIMhcv4gTpP3S=`nMUEP_CM+Iq2BY?rw=i_wn_Xu#XIZ}i65VngS+Vj
zG3U4BkS@8F`EI|;cK?qAeKY!7Qtk!UWn7MJ58e^Rqz~jR?>rQCHC4bGun0aPKmU8k
zxOr1K$5wXMB)0qBwR<{1uRdLn&hY6`-)iQ;B|>VV
zVl<{-Hi-L=2O+DScdCb>z%zHy#y1LUwI9onnZS
zR-CX2=!o@$0D{9WIfsV3I({Q1Xmx7ibe**3*=)cg3^QP~n+Wxg+&D|U{m;bqfPsJ9
z_DMcazs>WLMtra4>90ynY2lCQ6m;t2s(Mb-Wup2?-ral{YsLgdWU>qrDNtRYy&Vr&rH9`RgiXYBBlfPWb1fupW
zLrb-LWE_MaHFp0212#-pW(>o9%dhER+Yq|tS;PDI!HgF3jiEqQ&TI#9t-HGSX_x<%
zH<=g5Ip9i;ZUsmeQKU@z!L$jqbho|-mrQ9E+G9-m#4GqW$8shr6}Q&t&I#Yu@8_77
z34tbq_QBv9D`0u8Kzq%Lt4rAd;l?#_b!AplF|@a7?e682WGIKQ+ZE711u5rmh}_?;
z>&fn_IWX|sTE)sRJR6<3vzcp{&YnxBo&h$Co#0E>P+5{qN!@vcz=qSq3Ql;LYesq<
zvO~rKFB~SjZ7-rKn=Ser+1V7fZ{7tU<=(a)UN<1Co5$8}br6q(@Jx^^`aY(asfd=<
z&60&$11I}TnEp66`J<$G{8M+ad@E6~%dVDR2`gVJv`)+c%=OZujU-FqzN8i%YE#oH
z4zi=bj%jyk{)_K^RE_CiVSjSyvMDBfYjNfjr&L-_BgZ#2x50DK1P5Y$qso4CLT=&$8^+qgtK#15
zrLtQl-@ogkIJT}9D*YPsZyF+ieb;JPy6To)cudGLTCI<;#+A^8N<cM^Amhwowt{kvPWM*kaB}gF_2q9e&@qxqhzaAsCuoFGgv0(6teD-Ytx3)3n}FZ
zKjJ(}dTvM+Uh@GWIFL7YD2>Ib1FzA(7GWFvH%a_3vB>k}a21t;#7@)T%z@dr;>5|L
zP~mzSdOXsHntWLSA+=mU^}dgaxgWYoAKe)BNZ&9fGBA&OQk#3e`~rY9_N8W~pQkA8
z_Rb$s=IOr<-S(ZG$UquyL(_=2j^aR9DIqvlNB5@lg1i@#1gDGcx?QZhuTnk*no`gB
z9+u@>X4j-=H@)ZgXog79rC@gx_r(ZixUZ7&B0W4e?h0H3&d=ZU49$!vg^mZVvlyHo
zy3AXLc~h-MTnjs5bpOp6O{vzb#P3I2K!F>z9nsmI-dQ||B~rWJ(1#3;@~B-|QtXo4
zAuS?jx>+le*lt_Jxv3t#QXVfsH_HlShvS%AyBt_AU1Vb1rD}!YlMX8?hii5~x%JBw
zODwIasGT=*|D$ThfZ>;00Ln(T8T*nD>F3-DdH~t!cnSUPC3HXJOP?GDGX
zXkmA+rZ`J%bu%Yj`5wNcIE~RKluhr5k>K@L3`aQjA$3h+7bL3wRqU>>J7TEEv?XW+
z+50e>a`VQcIkRH+vVgYei88E;)T}>A!s7wy1i|v%qEwYJ|1`b!zuRe_^qdqVOX?b&
zFzsJ_DZ}-_V}<8$ZqD1I8k=>DXNMpB6;|tBx$wKIg|J`hHPgCQSnnlH8yJ-kkT@*A
zSzJ^0?|sEg1zU#T$`FlvllX6jiJMsX&F8EPO=JHjAgW2U?V&-D`U^?l1Y`yu2=`6Q
zdmS*0#)t=t--R#S{gw0exp=4y3(_H1YES@ifq7U-^{oLM3fii=Ur=@&l4=gI1aMRFH6
z13ip)wSf;k-PudjIQ^J?OhoPC`I%3?@T4e@$K&}_>=dQ$`YO|VwIvkB{0i4@;&2XMNQIlx9tXC@&(PsZY|FY8%QtBq;G
z)GreghbUDK7kZMaQMbR`_-PJQte;b4xWLfrWfD^fh%+3zEuMvqn<1-`=cg|hu&p1>#TgI9A+#biufwhju4}-1VUF(Z?5Y4z
z5l5bQqLm0Bv1^QEe>KF)V{jNJSKD=;I`3o4Uyl5O;}w3c-rUhXxzmPoWG}YwNHs
zLx-joF3nL@yI|$7y)3uC^vRsOYR2#U>*l*@(Klcj8bTldkGM%U8MSUUpJOKo)_G#&
zq`;U$>|emFWMM&+HYX~TVRT)J!;Ci$U~`ps45?0deX
zJ4Y*}*n*aUHOIMfnK#l~E83rhn{gjzRsG6j`W&R6VZW-@cV%5ss=S{@yE(V>bOIi^
zv76M|m7|
zdmojnb=AGqK7k>NFPzQHQ<0RLCvdAa8{-FRp*u2A)I@;?s4h(@z|IMH8bjHN`@M7u
zc)hh*Tq(qL^xeh45NGroF0;K-SbL9Zg9*lQaGp0Wk$aVP7K`rWN%Mu|z9yrs_%)rG
z+)$mLKKC4%K9IX{RycpKV79wC_0f3R+q+a-V3Mg%=kZvJ>a@3H0K25KV3vSxG~xI?AdQvY5H+@
z{Jut4Fvc!SE9ODfRXS3LuI3AusPvjVr~UtYpS{~BbErD|fZymJhBSg7fJ3_D1vo
z0U77_R1tF%ESQHDaPs_zs#Cy-%1SNniWfVej}Vt)h#(;J8GWlq)Mu+Ec7VOjqNAzL
z&ex!diKy!O!7M?gY@EZ3QKU)Rc)9>nS$$c$NuBzY>RaPw0vRiwFFWu@ZyWoBVCW|-lGhD0L$*0hrCj0Z@lrEaQLe!0%^u+Q!^NQ8
zP7c_$J?MWo7J4IB%T!qs6bmK#KHkTi_-iyfWq&(;
zG`6WVekS18-(Br4eg9v))wAuPMd49fP+kq6+-@;BE0J4;cY-tYqKsBOtY0dV)wuk*
zigTbCri;MM#D=9PaWmd4Ejd_;_AK0%YZqtm_U{Kez?3dO9bvSBN=>0n6M-C&ftW{5
zSC5p5RCxa0=ZFw|;iR?wi*o)PpV;1{Uc%@XDTtKs8v5v(p%&NGOb`RqdY-<2oFT6H
zVAObPHT@D~Z`#?N$&qp2VVQ|jM+J!|lH3#-$E6~8cF<&3w7od>C9r6PO~3zHp%M86
zi$#U()pXFk%GkJ&u<<;SjdwONHF6U9KuK*_QN4d@{z}h3zap>@F
zpHpHuO7QTZC(1VB{0)XmKZ@gQb1V0pd%jNat3W@0Q|n%=vDUh-A;LKl>i1uc4n4m|
zy|ninL$Mmz%sqY4wrbJ|YCb5Lom_LQqKS0(35L#^rk{8J(pCeo$Z)S0eRul>Z`V}6
z1*PWNZx3^=xc$CD1*+ni(lGKS(j)^({*{yL)+y9+3~X?7PBIb;yp3v82Gz}F2N&P5
zeHS_h?doSLe55Hd{pJ-+Id?KZRqr|+vO!Y^`FSD-2UQ`cs|
z4ntQ{;P#sk{z3DMQ*muj_PWdL-u10gZ{Te{PiM20^XyrM^3LmvHpA(EbW%^=-OEn#
z2#Cpt%7Cm3GIs>(HeDIEQ?)J{GVsM^Rhg!zWp|#QZ{a)LC^DH6MvgI#ntg$LNbFvt
z3G>_D1AKDA(&rp-RZ9JF0ENXOx8j5AA13VCV2
zju1KAp@8*SZ5jf*|KzB2qUu)h^_bYI
zWnYuCHhjDndHPf7z9Pj_GIymp+owA(GSE(y9~=rMu+M)u2Xf_@61Wyi`3n9z1l6v-
zg)W4E89px4M~(6_-b5fxSZJW<)
zh5s#m`so^bo=j*gB>nx@+VtoL;TGMXzBR`M{<#8du6XzYu2)btYh*zilTO(9SvY&7TNK7FXA=l-R_kDkh;k@-#M?IrAst=#{w
z?pa%Qnr_s++e0DM`FD@H++4UnP)|4bz9ZRleRp1a8K<-FuCVc-;-z8X6c_$Tj7sbs
zRl_f)_o$CYr=Ph?OKNzYUQo`GMP+#YHxXeC>lDZHVI=X?3NrBKOCKo=u}xKfZeb#VH8_&;@Wu5^4Da3vLr(b6E}e~Z`h
zks9&)uJPyFq2~3r|H|^W-A7&&b_Nntq2^u|iB#CeQlrp(hHk{Gci+g6&U;j7wEbKC
z*0zvBgWA&x^#!yMf1uYKzZhVfr|0hDBvSc*@!hA)`!pRyV_fZwFbOjcEUP0phhNkCsL?fMsg8W^KXyp4s5
zvHcH(`R0>(O}-)jw(R!tB(R49K@Ok7P;^J4xq^YOa-O!G(rxc=JQ=@is@6oxzoXW0Gt6j
zIgp}zDlXm{njJ69DgI2s1s__5^O~oR^F;VedRFp0pvZ1&mQ@d)j5SpX)h5QOkBa>$
z{Q3->zTfcM|6SN@L{g=r6k!^I?=sqT^@t1lO&tPAoJKAPbJEkuK?{`q+MpH6
zLT_e$h(5cLHA8mN9znLh|Kz1WczeNuZg5-Q)l#FBCwq(rXXiYNLS#N?C5k%HXcfHJ~X*U=p$GF|t+}|yDD!=qadPktT>QquoT>Qr<
zMR>^wu#ogl3m>;#b>N?Xlt19-=*s=)da29q`YEh?NggCVzX5wpf}tck<&Di(g#`gc
za*=q)V<>Baw}N~_jX%4|r9?OTT%*e`Kt%R_McCbn$7lQLCmxryy6E`+LG-dQh1i6Y
zG(18$BxZ-u+eA(+DBo4=+7BI>G+34YIuZLb?Tt1nPE#Q10gEDnYs-jHyVw8IjZ*k%
z)2R3C=yw4;NVb{7O8&Rt#E_ooZPP*|->m7z_$QIbFd-(pG~eA;HROIPaUtW0bQsuD
zAvZ6TDb`EMw_%8@OLv6sR+T<9Rq96V>4w(XrGF<8&LpB){xpZ5;rotF+;uEblX58X0Z;Mq
z4<>A6)g?)+tABz6`tk*Z$GG-jm0r}z+NB`649oV&`{TRCCd#|#Fm4kVI4jLv$%E`r
z)*--EHq3{AHE<`W`T?&%b-ffNHzP-sVHj^FDly{y!N#m5QnNj*rW0go37<~0e{B)N
z=05YjPq@_Ti@XL|7EhU&W$QzVZ1>TlREJ50%QQ>G8r?De)i0D
zPB?R-RIUNNS!0~jPf4Q!OnJy^5x@8MMfQ9MkMZn{skXsQkU=H3U2dP{tD4W0?c%Dh@|^XJW&XpE3q-W#udYNJ#*Z}wn2e0#xoTI=0-
zyr#L!Tid^qFV*@35pk4DXUHpC0H24cLh!qRbM@@Xh$(6ljh;P@tKX}7(lS3r&U$q9
zUrd8%>*THZoKx%QCM_<6>}v|UTn*c*BHo7UU6#XL5-nk+)ALoQ&U155Zsgp&hh3Ot
zN_N<(2(!>`ST@?p#7-)<=JrBZ$EUB5%{+<*Ih4FhC<7+hK5ZvvYmb~wzPBjdlcyhl
zPYJGw=$`$A!E$V|}Ocdp5^rHwaJ#+J_`Zlkd3@=?%7AteT95F6Cb<8=wjU|
znUBB%RDmlv4&&LZFHu+h#NV^y$%>rF)#@&@e)ze{+;iGrz5_b;EC1!0g
zF$32aAx~9yoMTMd=f}^40h&REotwNG!iD}{zn;sgd6eodt%U(YCxr
zkn~nR?~Rq4+qABj-EDlZxi={F>jHtIZW?zU%Wp6xWqzzlQXwX%B>z#6Atz14gtNNUBxdz&w{)+o>zZ7xvmy@Dq
z*67R(-1NnV>=9+Y%$Cv7t1`McmcJOa_B4=8xx=z{V?h>$M7w((jZK$(`WMox_&%=p&yLR}g
z@Uwc&Hkrcky{mBg2-25&3ce8U+e!NQ$$gW7!RvT@i>o8>vf8AER+3m2vVSt
z_e#Axsi7Yxna5lpdjE`$nt=1u&h2&|d_Dj0o9v#W=R?_j7K$(B;w|N@C4rd>sKwLK
zZOoL*IC>YhJ@>;uY5fTM^1|`#Q`*8@F(WXnga;9GtC+vT-KSpv9kI6TSR{gj-mUY>
zeQT5??I_bv2%ypsjyN}IK@-lZulL`p3!pNSb*lQ?KJtQ5=kp^c=UO&$TUEiXF~NXv
zCxy_vFx{t*zvzgP2OP@z`88k>MJFEHE4u4qc$g<-{pD;qc)e@hv}N;P=$)j#PD`Wu
zx7=V|1u>`!rti$RP6oqx<2)~=_5(*5_yvtg7P}KKb(vHItog^Gt5&w*-WW)|q&uZN>#q3ZYsl(bXtB#b&!XV%spED;Y_wW6BDkM(-^5)~cz^c_vL|M4}
z7SmifoW}erL$(;+Zv7UX2v!bepL#^|wp@3Mth@JhLF2^Am~eEuum}2hYRdYnl>im#
zgEd;fN`1KDT-DEG-QN;*n1Yt5;@HjXK8Sehn?Z*p3r_NhcLTlOm!F!Pj+(Xb1M;Jz
z#=|zFDP87{E&nc7O}x7kHF`#W>jCwu0z&Mb{sF{`xp^*V5S-Z@us`^m}I$-q~^Zy9D-qEHWLOB)H`gsX+cdiVrtq>v_xYkXC8
zyN&w=J55*9eZN*p*#30x_e%Xn!hV2T+Qs6BTk0?Nnmmkn%VS7Hxxq(LHgNXgky9vLhm*c
zj+H`XFOsNHij|vmgi%3(6wa)T%^VF{F+XB<$UmJWkWjr`R}_hS`m6h|b~Kt@h<_0h
z{|M}>SP4xzm}+|ZT$`+*SKzAfnCPy^#7KwAXWb>Bp+|HU-mkB7V-%kN6N{9cfq+}r
zRVnd(tkCPz;=LmUmoH*HC}j!rGha%7d9%*bXMjBV3O6r(RerbCUR7CXMu!Q|mfv?U
zQGeZ{i+;)F!sI4gP?cPAS{Lj)ATdsThuep_pRs==>sT}7cR}u#(aG4jr}6+F?209q
zvKA$QU;nO!YbHowBwyG52%K6rcu!TDr-;FZ7S{hRTc0FNcupM_E?Zj!qP07h8UnDZAfeK|=N8Hj~2rME`dPJDayTAHnMH
z?gAS-MR!EiZ(*yt$2VgeCB26|sl1GcQDXs7^JZ!~`C0o3d5%}4!Mjv!(tuNIr;DGz
zX9RXNG18