leetcode-practice:回购以保存我对leetcode问题的解决方案
需积分: 5 65 浏览量
2021-03-08
03:12:01
上传
评论
收藏 122KB ZIP 举报
leetcode-practice:回购以保存我对leetcode问题的解决方案 （190个子文件） 
[E]1114.Print-in-Order.java 2KB [M]959.Regions-Cut-By-Slashes.kt 7KB [H]699.Falling-Squares.kt 4KB [H]1559.Detect-Cycles-in-2D-Grid.kt 4KB [M]963.Minimum-Area-Rectangle-II.kt 4KB [H]51.N-Queens.kt 4KB [H]745.Prefix-and-Suffix-Search.kt 3KB [M]130.Surrounded-Regions.kt 3KB [M]130.Surrounded-Regions-2.kt 3KB [M]227.Basic-Calculator-II.kt 3KB [M]130.Surrounded-Regions-3.kt 3KB [M]1361.Validate-Binary-Tree-Nodes.kt 3KB [M]1091.Shortest-Path-in-Binary-Matrix.kt 2KB [H]1643.Kth-Smallest-Instructions.kt 2KB [M]1574.Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted.kt 2KB [M]216.Combination-Sum-III.kt 2KB [H]1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.kt 2KB [H]52.N-Queens-II.kt 2KB [M]210.Course-Schedule-II.kt 2KB [M]54.Spiral-Matrix.kt 2KB [E]88.Merge-Sorted-Array.kt 2KB [M]130.Surrounded-Regions-4.kt 2KB [M]146.LRU-Cache.kt 2KB [M]131.Palindrome-Partitioning.kt 2KB [E]155.Min-Stack-2.kt 2KB [H]1687.Delivering-Boxes-from-Storage-to-Ports.kt 2KB [M]230.Kth-Smallest-Element-in-a-BST.kt 2KB [E]937.Reorder-Data-in-Log-Files.kt 2KB [M]1541.Minimum-Insertions-to-Balance-a-Parentheses-String.kt 2KB [M]200.Number-of-Islands.kt 2KB [E]350.Intersection-of-Two-Arrays-II.kt 2KB [M]17.Letter-Combinations-of-a-Phone-Number.kt 2KB [E]1185.Day-of-the-Week.kt 2KB [M]79.Word-Search.kt 2KB [M]208.Implement-Trie(Prefix-Tree).kt 2KB [M]46.Permutations.kt 2KB [M]1457.Pseudo-Palindromic-Paths-in-a-Binary-Tree-V2.kt 2KB [H]1340.Jump-Game-V.kt 2KB [E]107.Binary-Tree-Level-Order-Traversal-II.kt 2KB [E]101.Symmetric-Tree.kt 2KB [M]1457.Pseudo-Palindromic-Paths-in-a-Binary-Tree.kt 2KB [M]29.Divide-Two-Integers-2.kt 2KB [M]289.Game-of-Life.kt 2KB [M]62.Unique-Paths.kt 1KB [M]2.Add-Two-Numbers.kt 1KB [E]1071.Greatest-Common-Divisor-of-Strings.kt 1KB [M]1261.Find-Elements-in-a-Contaminated-Binary-Tree.kt 1KB [E]234.Palindrome-Linked-List-O(1)Space.kt 1KB [M]15.3Sum.kt 1KB [M]15.3Sum-2.kt 1KB [M]33.Search-in-Rotated-Sorted-Array-2.kt 1KB [E]748.Shortest-Completing-Word.kt 1KB [M]103.Binary-Tree-Zigzag-Level-Order-Traversal.kt 1KB [H]84.Largest-Rectangle-in-Histogram.kt 1KB [H]1147.Longest-Chunked-Palindrome-Decomposition.kt 1KB [M]34.Find-First-and-Last-Position-of-Element-in-Sorted-Array.kt 1KB [M]109.Convert-Sorted-List-to-Binary-Search-Tree.kt 1KB [M]1011.Capacity-To-Ship-Packages-Within-D-Days.kt 1KB [M]939.Minimum-Area-Rectangle.kt 1KB [E]1260.Shift-2D-Grid.kt 1KB [M]91.Decode-Ways.kt 1KB [M]1016.Binary-String-With-Substrings-Representing-1-To-N.kt 1KB [M]207.Course-Schedule.kt 1KB [M]1590.Make-Sum-Divisible-by-P.kt 1KB [M]36.Valid-Sudoku.kt 1KB [M]150.Evaluate-Reverse-Polish-Notation.kt 1KB [M]138.Copy-List-with-Random-Pointer.kt 1KB [M]328.Odd-Even-Linked-List.kt 1KB [M]8.String-to-Integer-(atoi).kt 1KB [H]1383.Maximum-Performance-of-a-Team.kt 1KB [E]69.Sqrt(x).kt 1KB [E]21.Merge-Two-Sorted-Lists.kt 1KB [M]102.Binary-Tree-Level-Order-Traversal.kt 1KB [E]160.Intersection-of-Two-Linked-Lists.kt 1KB [M]75.Sort-Colors.kt 1KB [E]13.Roman-to-Integer.kt 1KB [E]125.Valid-Palindrome.kt 1KB [E]160.Intersection-of-Two-Linked-Lists-2.kt 1KB [M]56.Merge-Intervals-2.kt 1KB [M]384.Shuffle-an-Array.kt 1KB [M]467.Unique-Substrings-in-Wraparound-String.kt 1KB [M]22.Generate-Parentheses.kt 1KB [E]234.Palindrome-Linked-List.kt 1KB [M]19.Remove-Nth-Node-From-End-of-List.kt 1KB [M]1540.Can-Convert-String-in-K-Moves.kt 1KB [M]955.Delete-Columns-to-Make-Sorted-II.kt 1KB [E]217.Contains-Duplicate.kt 1KB [E]1.Two-Sum.kt 1KB [H]895.Maximum-Frequency-Stack.kt 1KB [M]198.House-Robber.kt 1022B [M]236.Lowest-Common-Ancestor-of-a-Binary-Tree.kt 1020B [M]139.Word-Break.kt 1018B [M]198.House-Robber-2.kt 1009B [M]116.Populating-Next-Right-Pointers-in-Each-Node.kt 994B [M]19.Remove-Nth-Node-From-End-of-List-2.kt 992B [E]108.Convert-Sorted-Array-to-Binary-Search-Tree.kt 983B [E]606.Construct-String-from-Binary-Tree.kt 975B [M]240.Search-a-2D-Matrix-II.kt 971B [M]48.Rotate-Image.kt 963B [M]134.Gas-Station.kt 958B共 190 条
- 1
- 2
资源评论
