File tree
622 files changed
+45453
-30552
lines changed- .github/workflows
- images
- lcci
- 04.05.Legal Binary Search Tree
- 04.06.Successor
- 04.08.First Common Ancestor
- 04.09.BST Sequences
- 04.10.Check SubTree
- 04.12.Paths with Sum
- 05.01.Insert Into Bits
- 05.02.Binary Number to String
- 05.03.Reverse Bits
- 05.04.Closed Number
- 05.06.Convert Integer
- 05.07.Exchange
- 05.08.Draw Line
- 08.01.Three Steps Problem
- 08.02.Robot in a Grid
- 08.03.Magic Index
- 08.04.Power Set
- 08.05.Recursive Mulitply
- 08.06.Hanota
- 08.07.Permutation I
- 08.08.Permutation II
- 08.09.Bracket
- 08.10.Color Fill
- 08.11.Coin
- 08.12.Eight Queens
- 08.13.Pile Box
- 08.14.Boolean Evaluation
- 10.01.Sorted Merge
- 10.02.Group Anagrams
- 10.03.Search Rotate Array
- 10.05.Sparse Array Search
- 10.09.Sorted Matrix Search
- 10.10.Rank from Stream
- 10.11.Peaks and Valleys
- 16.01.Swap Numbers
- 16.02.Words Frequency
- 16.04.Tic-Tac-Toe
- 16.05.Factorial Zeros
- 16.06.Smallest Difference
- 16.07.Maximum
- 16.10.Living People
- 16.11.Diving Board
- 16.13.Bisect Squares
- 16.14.Best Line
- 16.15.Master Mind
- 16.16.Sub Sort
- 16.17.Contiguous Sequence
- 16.20.T9
- 16.22.Langtons Ant
- 16.25.LRU Cache
- 16.26.Calculator
- 17.05.Find Longest Subarray
- 17.06.Number Of 2s In Range
- 17.07.Baby Names
- 17.08.Circus Tower
- 17.11.Find Closest
- lcof2/剑指 Offer II 033. 变位词组
- solution
- 0000-0099
- 0005.Longest Palindromic Substring
- 0008.String to Integer (atoi)
- 0012.Integer to Roman
- 0034.Find First and Last Position of Element in Sorted Array
- 0038.Count and Say
- 0051.N-Queens
- 0063.Unique Paths II
- 0065.Valid Number
- 0071.Simplify Path
- 0100-0199/0146.LRU Cache
- 0200-0299
- 0240.Search a 2D Matrix II
- 0281.Zigzag Iterator
- 0300-0399
- 0305.Number of Islands II
- 0314.Binary Tree Vertical Order Traversal
- 0400-0499/0422.Valid Word Square
- images
- 0600-0699
- 0602.Friend Requests II Who Has the Most Friends
- 0642.Design Search Autocomplete System
- 0647.Palindromic Substrings
- 0700-0799
- 0741.Cherry Pickup
- 0742.Closest Leaf in a Binary Tree
- 0744.Find Smallest Letter Greater Than Target
- 0745.Prefix and Suffix Search
- 0800-0899/0863.All Nodes Distance K in Binary Tree
- 0900-0999
- 0924.Minimize Malware Spread
- 0928.Minimize Malware Spread II
- 0987.Vertical Order Traversal of a Binary Tree
- 1000-1099
- 1017.Convert to Base -2
- 1019.Next Greater Node In Linked List
- 1022.Sum of Root To Leaf Binary Numbers
- 1024.Video Stitching
- 1025.Divisor Game
- 1027.Longest Arithmetic Subsequence
- 1058.Minimize Rounding Error to Meet Target
- 1059.All Paths from Source Lead to Destination
- 1100-1199
- 1128.Number of Equivalent Domino Pairs
- 1133.Largest Unique Number
- 1135.Connecting Cities With Minimum Cost
- 1136.Parallel Courses
- 1200-1299
- 1211.Queries Quality and Percentage
- 1235.Maximum Profit in Job Scheduling
- 1300-1399
- 1329.Sort the Matrix Diagonally
- 1346.Check If N and Its Double Exist
- 1385.Find the Distance Value Between Two Arrays
- 1400-1499
- 1463.Cherry Pickup II
- 1486.XOR Operation in an Array
- 1491.Average Salary Excluding the Minimum and Maximum Salary
- 1492.The kth Factor of n
- 1500-1599/1525.Number of Good Ways to Split a String
- 1600-1699
- 1614.Maximum Nesting Depth of the Parentheses
- 1652.Defuse the Bomb
- 1700-1799/1766.Tree of Coprimes
- 1800-1899
- 1840.Maximum Building Height
- 1863.Sum of All Subset XOR Totals
- 1900-1999
- 1928.Minimum Cost to Reach Destination in Time
- 1995.Count Special Quadruplets
- 2000-2099
- 2015.Average Height of Buildings in Each Segment
- 2044.Count Number of Maximum Bitwise-OR Subsets
- 2100-2199
- 2182.Construct String With Repeat Limit
- 2196.Create Binary Tree From Descriptions
- 2300-2399
- 2381.Shifting Letters II
- 2385.Amount of Time for Binary Tree to Be Infected
- 2400-2499
- 2406.Divide Intervals Into Minimum Number of Groups
- 2460.Apply Operations to an Array
- 2462.Total Cost to Hire K Workers
- 2473.Minimum Cost to Buy Apples
- 2500-2599
- 2517.Maximum Tastiness of Candy Basket
- 2521.Distinct Prime Factors of Product of Array
- 2522.Partition String Into Substrings With Values at Most K
- 2528.Maximize the Minimum Powered City
- 2550.Count Collisions of Monkeys on a Polygon
- 2600-2699
- 2639.Find the Width of Columns of a Grid
- 2645.Minimum Additions to Make Valid String
- 2700-2799
- 2708.Maximum Strength of a Group
- 2739.Total Distance Traveled
- 2771.Longest Non-decreasing Subarray From Two Arrays
- 2773.Height of Special Binary Tree
- 2798.Number of Employees Who Met the Target
- 2900-2999
- 2936.Number of Equal Numbers Blocks
- 2947.Count Beautiful Substrings I
- 2949.Count Beautiful Substrings II
- 3100-3199
- 3102.Minimize Manhattan Distances
- 3109.Find the Index of Permutation
- 3125.Maximum Number That Makes Result of Bitwise AND Zero
- 3126.Server Utilization Time
- 3127.Make a Square with the Same Color
- 3128.Right Triangles
- 3129.Find All Possible Stable Binary Arrays I
- 3130.Find All Possible Stable Binary Arrays II
- 3131.Find the Integer Added to Array I
- 3132.Find the Integer Added to Array II
- 3133.Minimum Array End
- 3134.Find the Median of the Uniqueness Array
- 3135.Equalize Strings by Adding or Removing Characters at Ends
- 3136.Valid Word
- 3137.Minimum Number of Operations to Make Word K-Periodic
- 3138.Minimum Length of Anagram Concatenation
- 3139.Minimum Cost to Equalize Array
- 3140.Consecutive Available Seats II
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
622 files changed
+45453
-30552
lines changedLines changed: 22 additions & 2 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 | 3 |
| |
4 |
| - | |
5 |
| - | |
| 4 | + | |
| 5 | + | |
| 6 | + | |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
| 11 | + | |
| 12 | + | |
| 13 | + | |
| 14 | + | |
| 15 | + | |
| 16 | + | |
| 17 | + | |
| 18 | + | |
| 19 | + | |
| 20 | + | |
| 21 | + | |
| 22 | + | |
| 23 | + | |
| 24 | + | |
| 25 | + | |
6 | 26 |
| |
7 | 27 |
| |
8 | 28 |
| |
|
Lines changed: 22 additions & 2 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 | 3 |
| |
4 |
| - | |
5 |
| - | |
| 4 | + | |
| 5 | + | |
| 6 | + | |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
| 11 | + | |
| 12 | + | |
| 13 | + | |
| 14 | + | |
| 15 | + | |
| 16 | + | |
| 17 | + | |
| 18 | + | |
| 19 | + | |
| 20 | + | |
| 21 | + | |
| 22 | + | |
| 23 | + | |
| 24 | + | |
| 25 | + | |
6 | 26 |
| |
7 | 27 |
| |
8 | 28 |
| |
|
Lines changed: 5 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
18 | 18 |
| |
19 | 19 |
| |
20 | 20 |
| |
| 21 | + | |
| 22 | + | |
| 23 | + | |
| 24 | + | |
| 25 | + | |
21 | 26 |
| |
22 | 27 |
| |
23 | 28 |
| |
|
Lines changed: 15 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
5 | 5 |
| |
6 | 6 |
| |
7 | 7 |
| |
| 8 | + | |
| 9 | + | |
| 10 | + | |
| 11 | + | |
| 12 | + | |
| 13 | + | |
| 14 | + | |
| 15 | + | |
| 16 | + | |
| 17 | + | |
8 | 18 |
| |
9 | 19 |
| |
10 | 20 |
| |
| |||
13 | 23 |
| |
14 | 24 |
| |
15 | 25 |
| |
| 26 | + | |
| 27 | + | |
| 28 | + | |
| 29 | + | |
16 | 30 |
| |
17 | 31 |
| |
18 | 32 |
| |
| 33 | + | |
19 | 34 |
| |
20 | 35 |
| |
21 | 36 |
| |
|
Lines changed: 4 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
4 | 4 |
| |
5 | 5 |
| |
6 | 6 |
| |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
7 | 11 |
| |
8 | 12 |
| |
9 | 13 |
| |
|
Lines changed: 4 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
4 | 4 |
| |
5 | 5 |
| |
6 | 6 |
| |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
7 | 11 |
| |
8 | 12 |
| |
9 | 13 |
| |
|
Lines changed: 4 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
4 | 4 |
| |
5 | 5 |
| |
6 | 6 |
| |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
7 | 11 |
| |
8 | 12 |
| |
9 | 13 |
| |
|
0 commit comments