forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit acda678
feat: update solutions to lc problems (doocs#2261)
1 parent 92e6a5c commit acda678
File tree
163 files changed
+365
-258
lines changed- lcci
- 10.03.Search Rotate Array
- 16.14.Best Line
- 17.06.Number Of 2s In Range
- 17.21.Volume of Histogram
- 17.23.Max Black Square
- lcof2/剑指 Offer II 012. 左右两边子数组的和相等
- lcof/面试题43. 1〜n整数中1出现的次数
- solution
- 0000-0099
- 0026.Remove Duplicates from Sorted Array
- 0039.Combination Sum
- 0040.Combination Sum II
- 0045.Jump Game II
- 0046.Permutations
- 0047.Permutations II
- 0055.Jump Game
- 0077.Combinations
- 0080.Remove Duplicates from Sorted Array II
- 0100-0199/0149.Max Points on a Line
- 0200-0299
- 0216.Combination Sum III
- 0233.Number of Digit One
- 0247.Strobogrammatic Number II
- 0248.Strobogrammatic Number III
- 0279.Perfect Squares
- 0296.Best Meeting Point
- 0300-0399
- 0322.Coin Change
- 0329.Longest Increasing Path in a Matrix
- 0357.Count Numbers with Unique Digits
- 0358.Rearrange String k Distance Apart
- 0400-0499
- 0413.Arithmetic Slices
- 0452.Minimum Number of Arrows to Burst Balloons
- 0462.Minimum Moves to Equal Array Elements II
- 0486.Predict the Winner
- 0487.Max Consecutive Ones II
- 0600-0699
- 0600.Non-negative Integers without Consecutive Ones
- 0616.Add Bold Tag in String
- 0640.Solve the Equation
- 0678.Valid Parenthesis String
- 0687.Longest Univalue Path
- 0700-0799
- 0712.Minimum ASCII Delete Sum for Two Strings
- 0724.Find Pivot Index
- 0757.Set Intersection Size At Least Two
- 0758.Bold Words in String
- 0767.Reorganize String
- 0777.Swap Adjacent in LR String
- 0788.Rotated Digits
- 0795.Number of Subarrays with Bounded Maximum
- 0800-0899
- 0834.Sum of Distances in Tree
- 0856.Score of Parentheses
- 0857.Minimum Cost to Hire K Workers
- 0877.Stone Game
- 0900-0999
- 0902.Numbers At Most N Given Digit Set
- 0927.Three Equal Parts
- 0940.Distinct Subsequences II
- 1000-1099
- 1004.Max Consecutive Ones III
- 1012.Numbers With Repeated Digits
- 1017.Convert to Base -2
- 1024.Video Stitching
- 1029.Two City Scheduling
- 1039.Minimum Score Triangulation of Polygon
- 1044.Longest Duplicate Substring
- 1062.Longest Repeating Substring
- 1065.Index Pairs of a String
- 1067.Digit Count in Range
- 1072.Flip Columns For Maximum Number of Equal Rows
- 1073.Adding Two Negabinary Numbers
- 1100-1199/1131.Maximum of Absolute Value Expression
- 1200-1299
- 1235.Maximum Profit in Job Scheduling
- 1245.Tree Diameter
- 1249.Minimum Remove to Make Valid Parentheses
- 1300-1399
- 1312.Minimum Insertion Steps to Make a String Palindrome
- 1326.Minimum Number of Taps to Open to Water a Garden
- 1330.Reverse Subarray To Maximize Array Value
- 1383.Maximum Performance of a Team
- 1400-1499
- 1444.Number of Ways of Cutting a Pizza
- 1483.Kth Ancestor of a Tree Node
- 1500-1599
- 1509.Minimum Difference Between Largest and Smallest Value in Three Moves
- 1513.Number of Substrings With Only 1s
- 1562.Find Latest Group of Size M
- 1573.Number of Ways to Split a String
- 1700-1799
- 1751.Maximum Number of Events That Can Be Attended II
- 1755.Closest Subsequence Sum
- 1774.Closest Dessert Cost
- 1778.Shortest Path in a Hidden Grid
- 1800-1899/1882.Process Tasks Using Servers
- 1900-1999
- 1915.Number of Wonderful Substrings
- 1944.Number of Visible People in a Queue
- 1987.Number of Unique Good Subsequences
- 1991.Find the Middle Index in Array
- 1994.The Number of Good Subsets
- 2000-2099
- 2004.The Number of Seniors and Juniors to Join the Company
- 2008.Maximum Earnings From Taxi
- 2010.The Number of Seniors and Juniors to Join the Company II
- 2100-2199
- 2104.Sum of Subarray Ranges
- 2116.Check if a Parentheses String Can Be Valid
- 2127.Maximum Employees to Be Invited to a Meeting
- 2128.Remove All Ones With Row and Column Flips
- 2200-2299
- 2204.Distance to a Cycle in Undirected Graph
- 2281.Sum of Total Strength of Wizards
- 2282.Number of People That Can Be Seen in a Grid
- 2290.Minimum Obstacle Removal to Reach Corner
- 2300-2399
- 2307.Check for Contradictions in Equations
- 2312.Selling Pieces of Wood
- 2328.Number of Increasing Paths in a Grid
- 2334.Subarray With Elements Greater Than Varying Threshold
- 2337.Move Pieces to Obtain a String
- 2348.Number of Zero-Filled Subarrays
- 2359.Find Closest Node to Given Two Nodes
- 2360.Longest Cycle in a Graph
- 2376.Count Special Integers
- 2382.Maximum Segment Sum After Removals
- 2400-2499
- 2402.Meeting Rooms III
- 2448.Minimum Cost to Make Array Equal
- 2500-2599
- 2554.Maximum Number of Integers to Choose From a Range I
- 2567.Minimum Score by Changing Two Elements
- 2572.Count the Number of Square-Free Subsets
- 2574.Left and Right Sum Differences
- 2581.Count Number of Possible Root Nodes
- 2600-2699
- 2603.Collect Coins in a Tree
- 2611.Mice and Cheese
- 2700-2799
- 2719.Count of Integers
- 2728.Count Houses in a Circular Street
- 2736.Maximum Sum Queries
- 2753.Count Houses in a Circular Street II
- 2800-2899
- 2801.Count Stepping Numbers in Range
- 2827.Number of Beautiful Integers in the Range
- 2836.Maximize Value of Function in a Ball Passing Game
- 2839.Check if Strings Can be Made Equal With Operations I
- 2840.Check if Strings Can be Made Equal With Operations II
- 2900-2999/2940.Find Building Where Alice and Bob Can Meet
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
163 files changed
+365
-258
lines changed| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
40 | 40 | | |
41 | 41 | | |
42 | 42 | | |
43 | - | ||
43 | + | ||
44 | 44 | | |
45 | 45 | | |
46 | 46 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
46 | 46 | | |
47 | 47 | | |
48 | 48 | | |
49 | - | ||
49 | + | ||
50 | 50 | | |
51 | 51 | | |
52 | 52 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
148 | 148 | | |
149 | 149 | | |
150 | 150 | | |
151 | - | ||
151 | + | ||
152 | 152 | | |
153 | 153 | | |
154 | 154 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
47 | 47 | | |
48 | 48 | | |
49 | 49 | | |
50 | - | ||
50 | + | ||
51 | + | ||
52 | + | ||
51 | 53 | | |
52 | 54 | | |
53 | 55 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
26 | 26 | | |
27 | 27 | | |
28 | 28 | | |
29 | - | ||
29 | + | ||
30 | 30 | | |
31 | 31 | | |
32 | 32 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
65 | 65 | | |
66 | 66 | | |
67 | 67 | | |
68 | - | ||
68 | + | ||
69 | 69 | | |
70 | 70 | | |
71 | 71 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
66 | 66 | | |
67 | 67 | | |
68 | 68 | | |
69 | - | ||
70 | - | ||
71 | - | ||
72 | - | ||
73 | - | ||
74 | - | ||
69 | + | ||
70 | + | ||
71 | + | ||
72 | + | ||
73 | + | ||
74 | + | ||
75 | 75 | | |
76 | 76 | | |
77 | 77 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
70 | 70 | | |
71 | 71 | | |
72 | 72 | | |
73 | - | ||
74 | - | ||
73 | + | ||
74 | + | ||
75 | 75 | | |
76 | 76 | | |
77 | 77 | | |
| |||
Lines changed: 1 addition & 1 deletion
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
81 | 81 | | |
82 | 82 | | |
83 | 83 | | |
84 | - | ||
84 | + | ||
85 | 85 | | |
86 | 86 | | |
87 | 87 | | |
| |||
Lines changed: 1 addition & 1 deletion
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
80 | 80 | | |
81 | 81 | | |
82 | 82 | | |
83 | - | ||
83 | + | ||
84 | 84 | | |
85 | 85 | | |
86 | 86 | | |
| |||
0 commit comments