Git Product home page Git Product logo

wisdompeak / leetcode Goto Github PK

View Code? Open in Web Editor NEW
5.5K 173.0 1.2K 8.87 MB

This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.

C++ 97.72% Python 2.08% CMake 0.13% Java 0.07%
leetcode algorithms cpp

leetcode's Introduction

My YouTube Channel: LeetCode Daily Live Coding and Interpretation

My LeetCode Daily Problem & Contest Group: See rules and score board here

(If you are interested in joining this group, ping me [email protected])

LeetCode难题代码和算法要点分析

目前分类目录

Two Pointers

011.Container-With-Most-Water (M+)
015.3Sum (M)
016.3Sum-Closet (M)
018.4Sum (M)
259.3Sum-Smaller (M+)
030.Substring-with-Concatenation-of-All-Words (H)
075.Sort-Colors (M+)
026.Remove Duplicates from Sorted Array (H-)
080.Remove Duplicates from Sorted Array II (H)
209.Minimum-Size-Subarray-Sum (M)
088.Merge Sorted Array (M)
283.Move-Zeroes (M)
141.Linked-List-Cycle (E+)
142.Linked-List-Cycle-II (M+)
360.Sort-Transformed-Array (M)
713.Subarray-Product-Less-Than-K (M+)
923.3Sum-With-Multiplicity (H-)
1234.Replace-the-Substring-for-Balanced-String (H-)
1498.Number-of-Subsequences-That-Satisfy-the-Given-Sum-Condition (H-)
1574.Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted (H-)
1580.Put-Boxes-Into-the-Warehouse-II (H-)
1687.Delivering-Boxes-from-Storage-to-Ports (H)
1793.Maximum-Score-of-a-Good-Subarray (M+)
1989.Maximum-Number-of-People-That-Can-Be-Caught-in-Tag (M+)
2354.Number-of-Excellent-Pairs (H-)
2422.Merge-Operations-to-Turn-Array-Into-a-Palindrome (H-)

Binary Search

004.Median-of-Two-Sorted-Arrays (H)
153.Find-Minimum-in-Rotated-Sorted-Array (M+)
154.Find-Minimum-in-Rotated-Sorted-Array-II (H-)    
033.Search-in-Rotated-Sorted-Array (M)
081.Search-in-Rotated-Sorted-Array-II (M)
034.Search-for-a-Range (M)
162.Find-Peak-Element (H-)
222.Count-Complete-Tree-Nodes (H-)
275.H-index II (H)
302.Smallest-Rectangle-Enclosing-Black-Pixels (M+)
475.Heaters (H-)
483.Smallest-Good-Base (H)
029.Divide-Two-Integers (M+)
644.Maximum-Average-Subarray-II (H)
658.Find-K-Closest-Elements (H)
1095.Find-in-Mountain-Array (TBD)
1157.Online-Majority-Element-In-Subarray (H-)
1533.Find-the-Index-of-the-Large-Integer (M)
1712.Ways-to-Split-Array-Into-Three-Subarrays (H)
1889.Minimum-Space-Wasted-From-Packaging (H-)
1901.Find-a-Peak-Element-II (H)
2563.Count-the-Number-of-Fair-Pairs (M+)
2819.Minimum-Relative-Loss-After-Buying-Chocolates (H)
2972.Count-the-Number-of-Incremovable-Subarrays-II (H-)

Hash Map

049.Group-Anagrams (M+)
149.Max-Points-on-a-Line (H)
166.Fraction-to-Recurring-Decimal (M)
170.Two-Sum-III-Data-structure-design (M)
392.Is-Subsequence (H-)
274.H-Index (H)
325.Maximum-Size-Subarray-Sum-Equals-k (M)
409.Longest-Palindrome (M)
447.Number-of-Boomerangs (E+)
438.Find-All-Anagrams-in-a-String (M+)
356.Line-Reflection (H-)
594.Longest-Harmonious-Subsequence (M+)
532.K-diff-Pairs-in-an-Array (E+)
446.Arithmetic-Slices-II-Subsequence (H)
128.Longest-Consecutive-Sequence (H-)
753.Cracking-the-Safe (H)
890.Find-and-Replace-Pattern (M+)
939.Minimum-Area-Rectangle (M+)
982.Triples-with-Bitwise-AND-Equal-To-Zero (M+) (TBD)
1074.Number-of-Submatrices-That-Sum-to-Target (M+)
1487.Making-File-Names-Unique (M+)
1573.Number-of-Ways-to-Split-a-String (M)
2131.Longest-Palindrome-by-Concatenating-Two-Letter-Words (M)
2198.Number-of-Single-Divisor-Triplets (H-)

Sorted Container

220.Contains-Duplicate-III (M)
363.Max-Sum-of-Rectangle-No-Larger-Than-K (H)
352.Data-Stream-as-Disjoint-Intervals (H)
480.Sliding-Window-Median (H)
699.Falling-Squares (H)
729.My-Calendar-I (M)
855.Exam-Room (M+)
975.Odd-Even-Jump (H-)
632.Smallest-Range-Covering-Elements-from-K-Lists (H-)
1675.Minimize-Deviation-in-Array (H)
1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers (M)
1348.Tweet-Counts-Per-Frequency (H-)
1488.Avoid-Flood-in-The-City (H-)
1606.Find-Servers-That-Handled-Most-Number-of-Requests (M)
1797.Design Authentication Manager (M)
1847.Closest-Room (M+)
1912.Design-Movie-Rental-System (M+)
2034.Stock Price Fluctuation (M)
2071.Maximum-Number-of-Tasks-You-Can-Assign (H)
2612.Minimum-Reverse-Operations (H)
2736.Maximum-Sum-Queries (H)

Tree

144.Binary-Tree-Preorder-Traversal (M+)
145.Binary-Tree-Postorder-Traversal (H-)
270.Closest-Binary-Search-Tree-Value (M+)
095.Unique-Binary-Search-Trees-II (H)
094.Binary Tree Inorder Traversal (H-)
110.Balanced-Binary-Tree (M+)
222.Count-Complete-Tree-Nodes (M+)
099.Recover-Binary-Search-Tree (H)
114.Flatten-Binary-Tree-to-Linked-List (M+)
098.Validate-Binary-Search-Tree (M)
117.Populating Next Right Pointers in Each Node II (H)
156.Binary-Tree-Upside-Down (H)
285.Inorder-Successor-in-BST (M)
298.Binary-Tree-Longest-Consecutive Sequence (M+)
450.Delete-Node-in-a-BST (H)
437.Path-Sum-III (H-)
333.Largest-BST-Subtree (H)
572.Subtree-of-Another-Tree (M)
549.Binary-Tree-Longest-Consecutive-Sequence-II (M)
173.Binary-Search-Tree-Iterator (M)
545.Boundary-of-Binary-Tree (H-)
272.Closest-Binary-Search-Tree-Value-II (M+)
226.Invert-Binary-Tree (M)
655.Print-Binary-Tree (M+)
897.Increasing-Order-Search-Tree (M+)
501.Find-Mode-in-Binary-Search-Tree (M+)
558.Quad-Tree-Intersection (M+)
662.Maximum-Width-of-Binary-Tree (H-)
742.Closest-Leaf-in-a-Binary-Tree (H)
863.All-Nodes-Distance-K-in-Binary-Tree (H-)
958.Check-Completeness-of-a-Binary-Tree (M+)
1339. Maximum-Product-of-Splitted-Binary-Tree (TBD)
1104.Path-In-Zigzag-Labelled-Binary-Tree (M+)
1660.Correct-a-Binary-Tree (M+)
1666.Change-the-Root-of-a-Binary-Tree (H-)
1932.Merge-BSTs-to-Create-Single-BST (H)
2003.Smallest-Missing-Genetic-Value-in-Each-Subtree (H)
2445.Number-of-Nodes-With-Value-One (M+)

Segment Tree

307.Range-Sum-Query-Mutable (H-)
1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Array (H-)
1649.Create-Sorted-Array-through-Instructions (H-)
1157.Online-Majority-Element-In-Subarray (H)
370.Range-Addition (H)
218.The-Skyline-Problem (H+)
699.Falling-Squares (H)
715.Range-Module (H)
2286.Booking-Concert-Tickets-in-Groups (H-)
2407.Longest-Increasing-Subsequence-II (H-)
2569.Handling-Sum-Queries-After-Update (H)
2907.Maximum-Profitable-Triplets-With-Increasing-Prices-I (H)
2916.Subarrays-Distinct-Element-Sum-of-Squares-II (H+)
3072.Distribute-Elements-Into-Two-Arrays-II (H-)

[Binary Index Tree]

307.Range-Sum-Query-Mutable (M)
1649.Create-Sorted-Array-through-Instructions (H)
2031.Count-Subarrays-With-More-Ones-Than-Zeros (H)
2179.Count-Good-Triplets-in-an-Array (H)
2659.Make-Array-Empty (H)

Design

380.Insert-Delete-GetRandom-O(1) (M+)
381.Insert-Delete-GetRandom-O1-Duplicates-allowed (H-)
716.Max-Stack (M+)
355.Design-Twitter (H)
535.Encode-and-Decode-TinyURL (M)
631.Design-Excel-Sum-Formula (M+)
642.Design-Search-Autocomplete-System (M+)
895.Maximum-Frequency-Stack (H)
1146.Snapshot-Array (H)
1172.Dinner-Plate-Stacks (H)
1381.Design-a-Stack-With-Increment-Operation (H-)
1352.Product-of-the-Last-K-Numbers (M+)
1418.Display-Table-of-Food-Orders-in-a-Restaurant (H-)
1622.Fancy-Sequence (H+)
1801.Number-of-Orders-in-the-Backlog (M+)
2166.Design-Bitset (M+)

Stack

032.Longest-Valid-Parentheses (H)
155.Min-Stack (M)
225.Implement Stack using Queues (H-)
232.Implement-Queue-using-Stacks (H-)
341.Flatten-Nested-List-Iterator (M)
173.Binary-Search-Tree-Iterator (M)
536.Construct-Binary-Tree-from-String (M)
456.132-Pattern (H-)
636.Exclusive-Time-of-Functions (H-)
856.Score-of-Parentheses (M+)
946.Validate-Stack-Sequences（H-）
1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses (H-)
1209.Remove-All-Adjacent-Duplicates-in-String-II (M+)
1586.Binary-Search-Tree-Iterator-II (H)
2197.Replace-Non-Coprime-Numbers-in-Array (H-)
2296.Design-a-Text-Editor (M+)
2751.Robot-Collisions (M+)
2764.is-Array-a-Preorder-of-Some-Binary-Tree (M+)

Deque

239.Sliding-Window-Maximum (H-)
862.Shortest-Subarray-with-Sum-at-Least-K (H)
1425.Constrained-Subsequence-Sum (H)
1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit (H)
1499.Max-Value-of-Equation (M+)
1562.Find-Latest-Group-of-Size-M (H)
1696.Jump-Game-VI (M+)
1776.Car-Fleet-II (H)
2398.Maximum-Number-of-Robots-Within-Budget (H-)
2762.Continuous-Subarrays (M+)
2969.Minimum-Number-of-Coins-for-Fruits-II (H-)

Priority Queue

004.Median-of-Two-Sorted-Arrays (H)
373.Find-K-Pairs-with-Smallest-Sums (H-)
871.Minimum-Number-of-Refueling-Stops (H-)
1057.Campus-Bikes (H-)
1167.Minimum-Cost-to-Connect-Sticks (H-)
1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows (H-)
1642.Furthest-Building-You-Can-Reach (H-)
1705.Maximum-Number-of-Eaten-Apples (M+)
1792.Maximum-Average-Pass-Ratio (M+)
2263.Make-Array-Non-decreasing-or-Non-increasing (H)
2386.Find-the-K-Sum-of-an-Array (H+)
2931.Maximum-Spending-After-Buying-Items (M)

DFS

037.Sudoku-Solver (M+)
040.Combination-Sum-II (M+)
051.N-Queens (M)
131.Palindrome-Partitioning (M+)
291.Word-Pattern-II (M)
417.Pacific-Atlantic-Water-Flow (M)
200.Number-of-Islands (M)
282.Expression-Add-Operators (H)
312.Burst-Balloons (H-)
351.Android-Unlock-Patterns (H-)
399.Evaluate-Division (H-)
488.Zuma-Game (H-)
425.Word-Squares (H-)
959.Regions-Cut-By-Slashes (M+)
1306.Jump-Game-III (M)
1718.Construct-the-Lexicographically-Largest-Valid-Sequence (H-)
1766.Tree-of-Coprimes (H-)
2014.Longest-Subsequence-Repeated-k-Times (H)
2056.Number-of-Valid-Move-Combinations-On-Chessboard (H)
2065.Maximum-Path-Quality-of-a-Graph (M)
2850.Minimum-Moves-to-Spread-Stones-Over-Grid (M)

BFS

127.Word-Ladder (M+)
126.Word-Ladder-II (M+)
130.Surrounded-Regions (H-)
200.Number-of-Islands (H-)
490.The-Maze (M)
529.Minesweeper (M+)
637.Average-of-Levels-in-Binary-Tree (M)
675.Cut-Off-Trees-for-Golf-Event (M)
694.Number-of-Distinct-Islands (M+)
785.Is-Graph-Bipartite (M+)
815.Bus-Routes (M+)
838.Push-Dominoes (M+)
928.Minimize-Malware-Spread-II (H-)
1036.Escape-a-Large-Maze (H)
1245.Tree-Diameter (H)
1263.Minimum-Moves-to-Move-a-Box-to-Their-Target-Location (H)
1298.Maximum-Candies-You-Can-Get-from-Boxes (M+)
1311.Get-Watched-Videos-by-Your-Friends (M)
1345.Jump-Game-IV (M+)
1559.Detect-Cycles-in-2D-Grid (M)
1568.Minimum-Number-of-Days-to-Disconnect-Island (H-)
1617.Count-Subtrees-With-Max-Distance-Between-Cities (H-)
1654.Minimum-Jumps-to-Reach-Home (H-)
1905.Count-Sub-Islands (M+)
2045.Second-Minimum-Time-to-Reach-Destination (M+)
2101.Detonate-the-Maximum-Bombs (M+)
2258.Escape-the-Spreading-Fire (H+)
2290.Minimum-Obstacle-Removal-to-Reach-Corner (M+)
2493.Divide-Nodes-Into-the-Maximum-Number-of-Groups (H-)
2812.Find-the-Safest-Path-in-a-Grid (M+)

Trie

208.Implement-Trie--Prefix-Tree (M+)
1804.Implement-Trie-II-(Prefix-Tree) (M+)
211.Add-and-Search-Word (H-)
472.Concatenated-Words (H-)
642.Design-Search-Autocomplete-System (H-)
648.Replace-Words (H)
588.Design-In-Memory-File-System (H-)
677.Map-Sum-Pairs (M)
676.Implement-Magic-Dictionary (H-)
139.Word-Break (M+)
140.Word-Break-II (M+)
212.Word-Search-II (H)
745.Prefix-and-Suffix-Search (H-)
1268.Search-Suggestions-System (H-)
1032. Stream of Characters (TBD)
1858.Longest-Word-With-All-Prefixes (M)
2416.Sum-of-Prefix-Scores-of-Strings (M)
2977.Minimum-Cost-to-Convert-String-II (H)
3093.Longest-Common-Suffix-Queries (H-)

Linked List

061.Rotate-List (M)
082.Remove-Duplicates-from-Sorted-List-II (M+)
086.Partition-List (M)
142.Linked-List-Cycle-II (M+)
109.Convert-Sorted-List-to-Binary-Search-Tree (M)
369.Plus-One-Linked-List (M)
430.Flatten-a-Multilevel-Doubly-Linked-List (H-)
457.Circular-Array-Loop (H-)
708.Insert-into-a-Cyclic-Sorted-List (H-)
1474.Delete-N-Nodes-After-M-Nodes-of-a-Linked-List (M+)
1670.Design-Front-Middle-Back-Queue (M+)
1756.Design-Most-Recently-Used-Queue (H)

Dynamic Programming

264.Ugly-Number-II (H-)
313.Super-Ugly-Number (H-)
091.Decode-Ways (M)
639.Decode-Ways-II (H)
634.Find-the-Derangement-of-An-Array (H)
823.Binary-Trees-With-Factors (M+)
221.Maximal-Square (H-)
1277.Count-Square-Submatrices-with-All-Ones (M+)
600.Non-negative-Integers-without-Consecutive-Ones (H)
656.Coin-Path (H-)
818.Race-Car (H)
377.Combination-Sum-IV (M)
837.New-21-Game (H-)
887.Super-Egg-Drop (H)
1884.Egg-Drop-With-2-Eggs-and-N-Floors (H-)
920.Number-of-Music-Playlists (H)
940.Distinct-Subsequences-II (H)
1987.Number-of-Unique-Good-Subsequences (H)
446.Arithmetic-Slices-II-Subsequence (H-)
1027.Longest-Arithmetic-Sequence (M+)
1269.Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps (M+)
1316.Distinct-Echo-Substrings (M+)
1420.Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons (H-)
1444. Number of Ways of Cutting a Pizza (TBD)
1531.String-Compression-II (H+)
1575.Count-All-Possible-Routes (M+)
1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segments (H)
1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionary (H-)
1692.Count-Ways-to-Distribute-Candies (H-)
1787.Make-the-XOR-of-All-Segments-Equal-to-Zero (H)
1872.Stone-Game-VIII (H-)
1900.The-Earliest-and-Latest-Rounds-Where-Players-Compete (H)
1937.Maximum-Number-of-Points-with-Cost (H-)
1955.Count-Number-of-Special-Subsequences (H-)
2088.Count-Fertile-Pyramids-in-a-Land (H-)
2140.Solving-Questions-With-Brainpower (H)
2189.Number-of-Ways-to-Build-House-of-Cards (H-)
2218.Maximum-Value-of-K-Coins-From-Piles (H-)
2222.Number-of-Ways-to-Select-Buildings (M+)
2312.Selling-Pieces-of-Wood (M+)
2338.Count-the-Number-of-Ideal-Arrays (H)
2431.Maximize-Total-Tastiness-of-Purchased-Fruits (M+)
2484.Count-Palindromic-Subsequences (H-)
2713.Maximum-Strictly-Inreasing-Cells-in-a-Matrix (H-)
2787.Ways-to-Express-an-Integer-as-Sum-of-Powers (M+)
2809.Minimum-Time-to-Make-Array-Sum-At-Most-x (H)
2826.Sorting-Three-Groups (M)
2851.String-Transformation (H+)
2896.Apply-Operations-to-Make-Two-Strings-Equal (H)
2979.Most-Expensive-Item-That-Can-Not-Be-Bought (M+)
3041.Maximize-Consecutive-Elements-in-an-Array-After-Modification (H-)
3082.Find-the-Sum-of-the-Power-of-All-Subsequences (H-)
3098.Find-the-Sum-of-Subsequence-Powers (H)

Bit Manipulation

137.Single-Number-II (H-)
260.Single-Number-III (H)
371.Sum-of-Two-Integers (H)
318.Maximum-Product-of-Word-Lengths (M+)
342.Power-of-Four (H)
898.Bitwise-ORs-of-Subarrays (H-)
957.Prison-Cells-After-N-Days (H)
1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K (TBD)
1521.Find-a-Value-of-a-Mysterious-Function-Closest-to-Target (H-)
2505.Bitwise-OR-of-All-Subsequence-Sums (H)
2680.Maximum-OR (M+)
2802.Find-The-K-th-Lucky-Number (M+)
2992.Number-of-Self-Divisible-Permutations (M+)

Divide and Conquer

315.Count-of-Smaller-Numbers-After-Self (H-)
327.Count-of-Range-Sum (H-)
493.Reverse-Pairs (M+)
1649.Create-Sorted-Array-through-Instructions (H)
2426.Number-of-Pairs-Satisfying-Inequality (H-)

String

006.ZigZag-Conversion (M+)
068.Text-Justification (H)
336.Palindrome-Pairs (H-)
388.Longest-Absolute-File-Path (M+)
418.Sentence-Screen-Fitting (M+)
423.Reconstruct-Original-Digits-from-English (H-)
616.Add-Bold-Tag-in-String (M)
467.Unique-Substrings-in-Wraparound-String (H-)
564.Find-the-Closest-Palindrome (H)
722.Remove-Comments (H)
736.Parse-Lisp-Expression (H-)
816.Ambiguous-Coordinates (M+)
844.Backspace-String-Compare (M+)
1616.Split-Two-Strings-to-Make-Palindrome (M+)
1754.Largest-Merge-Of-Two-Strings (M+)
1849.Splitting-a-String-Into-Descending-Consecutive-Values (M+)
2468.Split-Message-Based-on-Limit (H-)

Union Find

547.Friend-Circles (M)
200.Number-of-Islands (H-)
305.Number-of-Islands-II (H-)
130.Surrounded-Regions (H-)
128.Longest-Consecutive-Sequence (H-)
684.Redundant-Connection (M)
685.Redundant-Connection-II (H)
721.Accounts-Merge (M+)
765.Couples-Holding-Hands (H-)
785.Is-Graph-Bipartite (M+)
924.Minimize-Malware-Spread (H-)
947.Most-Stones-Removed-with-Same-Row-or-Column (M+)
959.Regions-Cut-By-Slashes (H-)
990.Satisfiability-of-Equality-Equations (M+)
1061.Lexicographically-Smallest-Equivalent-String (M)
1101.The-Earliest-Moment-When-Everyone-Become-Friends (M+)
1202.Smallest-String-With-Swaps (M+)
1319.Number-of-Operations-to-Make-Network-Connected (M+)
1632.Rank-Transform-of-a-Matrix (H)
1724.Checking-Existence-of-Edge-Length-Limited-Paths-II (H+)
1722.Minimize-Hamming-Distance-After-Swap-Operations (M+)
2076.Process-Restricted-Friend-Requests (H-)
2092.Find-All-People-With-Secret (H-)
2157.Groups-of-Strings (H)
2492.Minimum-Score-of-a-Path-Between-Two-Cities (M)
2867.Count-Valid-Paths-in-a-Tree (M+)

Recursion

087.Scramble-String (H-)
133.Clone-Graph (M+)
213.House-Robber-II (H-)
337.House-Robber-III (M+)
2378.Choose-Edges-to-Maximize-Score-in-a-Tree (H-)
390.Elimination-Game (H)
395.Longest-Substring-with-At-Least-K-Repeating-Characters (H)
397.Integer-Replacement (M+)
761.Special-Binary-String (H)
779.K-th-Symbol-in-Grammar (M)
780.Reaching-Points (H-)
808.Soup-Servings (H)
880.Decoded-String-at-Index (H-)
902.Numbers-At-Most-N-Given-Digit-Set (M)
964.Least-Operators-to-Express-Number (H)
991.Broken-Calculator (M)
1088.Confusing-Number-II (H)
1199.Minimum-Time-to-Build-Blocks (H+)
1274.Number-of-Ships-in-a-Rectangle (M)
1553.Minimum-Number-of-Days-to-Eat-N-Oranges (H)
1611.Minimum-One-Bit-Operations-to-Make-Integers-Zero (H)
2998.Minimum-Number-of-Operations-to-Make-X-and-Y-Equal (M+)

Graph

332.Reconstruct-Itinerary (H)
2097.Valid-Arrangement-of-Pairs (H)
753.Cracking-the-Safe (H)
1059.All-Paths-from-Source-Lead-to-Destination (H)
1192.Critical-Connections-in-a-Network (H)
1361.Validate-Binary-Tree-Nodes (TBD)
1719.Number-Of-Ways-To-Reconstruct-A-Tree (H+)
1761.Minimum-Degree-of-a-Connected-Trio-in-a-Graph (M+)
1782.Count-Pairs-Of-Nodes (H)
2360.Longest-Cycle-in-a-Graph (M+)
2508.Add-Edges-to-Make-Degrees-of-All-Nodes-Even (H-)
2556.Disconnect-Path-in-a-Binary-Matrix-by-at-Most-One-Flip (H)
2603.Collect-Coins-in-a-Tree (H-)
2608.Shortest-Cycle-in-a-Graph (M+)
2791.Count-Paths-That-Can-Form-a-Palindrome-in-a-Tree (H)
2876.Count-Visited-Nodes-in-a-Directed-Graph (M+)
3017.Count-the-Number-of-Houses-at-a-Certain-Distance-II (H)

Math

089.Gray-Code (M+) (aka. 1238. Circular Permutation in Binary Representation)
458.Poor-Pigs (H)
400.n-th-digit (M)
441.Arranging-Coins (M-)
628.Maximum-Product-of-Three-Numbers (M)
672.Bulb-Switcher-II (H)
754.Reach-a-Number (H)
829.Consecutive-Numbers-Sum (M)
878.Nth-Magical-Number (M+)
883.Projection-Area-of-3D-Shapes (E+)
891.Sum-of-Subsequence-Widths (M+)
899.Orderly-Queue (M)
963.Minimum-Area-Rectangle-II (H-)
964.Least-Operators-to-Express-Number (H)
972.Equal-Rational-Numbers (H)
1017.Convert-to-Base--2 (M+)
1073.Adding-Two-Negabinary-Numbers (H-)
1025.Divisor-Game (M)
1040.Moving-Stones-Until-Consecutive-II (H)
1015.Smallest-Integer-Divisible-by-K (M+)
1103.Distribute-Candies-to-People (M+)
1330.Reverse-Subarray-To-Maximize-Array-Value (TBD)
1250.Check-If-It-Is-a-Good-Array (M+)
1680.Concatenation-of-Consecutive-Binary-Numbers (M)
1739.Building-Boxes (H-)
1806.Minimum-Number-of-Operations-to-Reinitialize-a-Permutation (H)
1922.Count-Good-Numbers (M)
1969.Minimum-Non-Zero-Product-of-the-Array-Elements (M+)
2128.Remove-All-Ones-With-Row-and-Column-Flips (M+)
2217.Find-Palindrome-With-Fixed-Length (M+)

Greedy

055.Jump-Game (E+)
045.Jump-Game-II (M)
134.Gas-Station (H)
659.Split-Array-into-Consecutive-Subsequences (H)
386.Lexicographical-Numbers (H)
624.Maximum-Distance-in-Arrays (M)
665.Non-decreasing-Array (H)
670.Maximum-Swap (M+)
649.Dota2-Senate (H)
683.K-Empty-Slots　(H)
517.Super-Washing-Machines (H)
870.Advantage-Shuffle (M)
781.Rabbits-in-Forest (M+)
881.Boats-to-Save-People (H-)
910.Smallest-Range-II (M+)
916.Word-Subsets (M+)
936.Stamping-The-Sequence (H)
948.Bag-of-Tokens (M+)
968.Binary-Tree-Cameras (H)
955.Delete-Columns-to-Make-Sorted-II (M+)
1040.Moving-Stones-Until-Consecutive-II (H)
1121.Divide Array Into Increasing Sequences (TBD)
1191.K-Concatenation-Maximum-Sum (M+)
1253.Reconstruct-a-2-Row-Binary-Matrix (M)
1354.Construct-Target-Array-With-Multiple-Sums (H-)
1414.Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K (M+)
1505.Minimum-Possible-Integer-After-at-Most-K-Adjacent-Swaps-On-Digits (H)
1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Array (H-)
1535.Find-the-Winner-of-an-Array-Game (M+)
1536.Minimum-Swaps-to-Arrange-a-Binary-Grid (H-)
1540.Can-Convert-String-in-K-Moves (M+)
1567.Maximum-Length-of-Subarray-With-Positive-Product (M+)
1578.Minimum-Deletion-Cost-to-Avoid-Repeating-Letters (M)
1585.Check-If-String-Is-Transformable-With-Substring-Sort-Operations (H)
1657.Determine-if-Two-Strings-Are-Close (M)
1702.Maximum-Binary-String-After-Change (H-)
1717.Maximum-Score-From-Removing-Substrings (M+)
1727.Largest-Submatrix-With-Rearrangements (M)
1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day (M)
1788.Maximize-the-Beauty-of-the-Garden (M+)
1818.Minimum-Absolute-Sum-Difference (M+)
1850.Minimum-Adjacent-Swaps-to-Reach-the-Kth-Smallest-Number (M+)
1911.Maximum-Alternating-Subsequence-Sum (M+)
2086.Minimum-Number-of-Buckets-Required-to-Collect-Rainwater-from-Houses (M+)
2136.Earliest-Possible-Day-of-Full-Bloom (M+)
2170.Minimum-Operations-to-Make-the-Array-Alternating (M+)
2171.Removing-Minimum-Number-of-Magic-Beans (M)
2182.Construct-String-With-Repeat-Limit (M+)
2193.Minimum-Number-of-Moves-to-Make-Palindrome (H+)
2216.Minimum-Deletions-to-Make-Array-Beautiful (M+)
2242.Maximum-Score-of-a-Node-Sequence (M+)
2257.Count-Unguarded-Cells-in-the-Grid (M+)
2271.Maximum-White-Tiles-Covered-by-a-Carpet (M+)
2275.Largest-Combination-With-Bitwise-AND-Greater-Than-Zero (M+)
2306.Naming-a-Company (H-)
2311.Longest-Binary-Subsequence-Less-Than-or-Equal-to-K (H-)
2332.The-Latest-Time-to-Catch-a-Bus (H-)
2350.Shortest-Impossible-Sequence-of-Rolls (M+)
2365.Task-Scheduler-II (M)
2366.Minimum-Replacements-to-Sort-the-Array (H-)
2371.Minimize-Maximum-Value-in-a-Grid (M+)
2449.Minimum-Number-of-Operations-to-Make-Arrays-Similar (M+)
2457.Minimum-Addition-to-Make-Integer-Beautiful (M)
2546.Apply-Bitwise-Operations-to-Make-Strings-Equal (M+)
2551.Put-Marbles-in-Bags (M+)
2561.Rearranging-Fruits (H-)
2598.Smallest-Missing-Non-negative-Integer-After-Operations (M)
2813.Maximum-Elegance-of-a-K-Length-Subsequence (H-)
2835.Minimum-Operations-to-Form-Subsequence-With-Target-Sum (M+)
2871.Split-Array-Into-Maximum-Number-of-Subarrays (M+)
2868.The-Wording-Game (M)
2897.Apply-Operations-on-Array-to-Maximize-Sum-of-Squares (M+)
3022.Minimize-OR-of-Remaining-Elements-Using-Operations (H)

Simulation

2061.Number-of-Spaces-Cleaning-Robot-Cleaned (M)
2069.Walking-Robot-Simulation-II (M+)
2532.Time-to-Cross-a-Bridge (H)

Others  

007.Reverse-Integer (M)
048.Rotate-Image (M+)
065.Valid-Number (H-)
158.Read-N-Characters-Given-Read4-II-Call-multiple-times　(H-)
240.Search-a-2D-Matrix-II (M+)
277.Find-the-Celebrity (H-)
311.Sparse-Matrix-Multiplication (M)
168.Excel-Sheet-Column-Title (H)
453.Minimum-Moves-to-Equal-Array-Elements (M)
782.Transform-to-Chessboard (H+)
466.Count-The-Repetitions (H)
810.Chalkboard-XOR-Game (H)
420.Strong-Password-Checker (H)
775.Global-and-Local-Inversions (M)
348.Design-Tic-Tac-Toe (M)
794.Valid-Tic-Tac-Toe-State (M+)
825.Friends-Of-Appropriate-Ages (M+)
835.Image-Overlap (H)
843.Guess-the-Word (M)
918.Maximum-Sum-Circular-Subarray (H-)
927.Three-Equal-Parts (M)
978.Longest-Turbulent-Subarray (H-)
1183.Maximum-Number-of-Ones (H)
1224.Maximum-Equal-Frequency (H) (aka. 2423. Remove Letter To Equalize Frequency)
1267.Count-Servers-that-Communicate (M+)
1538.Guess-the-Majority-in-a-Hidden-Array (M+)
1706.Where-Will-the-Ball-Fall (M+)
1749.Maximum-Absolute-Sum-of-Any-Subarray (M+)
1752.Check-if-Array-Is-Sorted-and-Rotated (M)
1826.Faulty-Sensor (M+)
1861.Rotating-the-Box (M)
1862.Sum-of-Floored-Pairs (M+)
1904.The-Number-of-Full-Rounds-You-Have-Played (M)
1997.First-Day-Where-You-Have-Been-in-All-the-Rooms (H)
2018.Check-if-Word-Can-Be-Placed-In-Crossword (M+)
2147.Number-of-Ways-to-Divide-a-Long-Corridor (M)
2337.Move-Pieces-to-Obtain-a-String (aka. 777.Swap-Adjacent-in-LR-String) (M+)
2359.Find-Closest-Node-to-Given-Two-Nodes (M)
2380.Time-Needed-to-Rearrange-a-Binary-String (H)
2453.Destroy-Sequential-Targets (M)
2591.Distribute-Money-to-Maximum-Children (M+)
2647.Color-the-Triangle-Red (H)
2718.Sum-of-Matrix-After-Queries (M+)
2808.Minimum-Seconds-to-Equalize-a-Circular-Array (M+)
2811.Check-if-it-is-Possible-to-Split-Array (M+)
3068.Find-the-Maximum-Sum-of-Node-Values (M+)

Thinking  

2860.Happy-Students (M+)
2862.Maximum-Element-Sum-of-a-Complete-Subset-of-Indices (H-)
2910.Minimum-Number-of-Groups-to-Create-a-Valid-Assignment (H-)
2939.Maximum-Xor-Product (H-)
2957.Remove-Adjacent-Almost-Equal-Characters (M)
330.Patching-Array (H)
1798.Maximum-Number-of-Consecutive-Values-You-Can-Make (H-)
2952.Minimum-Number-of-Coins-to-be-Added (H-)

LeetCode Cup

LCP23.魔术排列
LCP24.数字游戏
LCP25.古董键盘
LCP32.批量处理任务
LCP35.电动车游城市
LCP36.最多牌组数
LCP43.十字路口的交通

Templates  

Math
Binary_Index_Tree
Segment Tree
Inverse_Element
Graph
Bit_Manipulation
RB_Tree
二维子矩阵求和
二维差分数组
CPP_LANG

SQL

leetcode's People

Contributors

achillesmiller avatar allenlipeng47 avatar bill0412 avatar birdca avatar dreamingbird88 avatar dzf0023 avatar future-outlier avatar h-shi avatar konantian avatar leafz96 avatar meng621 avatar mightyrabbit99 avatar mooophy avatar nickee1942 avatar palkesh06 avatar refinedcoding avatar suri-feng avatar wisdompeak avatar xymabinogi avatar yaoyi92 avatar zhi-zhi-zhi avatar

Stargazers

avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar

Watchers

avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar

Forkers

jianminchen yxing999 bq18 usraptor2016 ghostdragon007 fengyuan1216 haiqiangzha yy2792 sugarac csf0630p zhenyu-j narutolby ycjian cooboos fansrepo jpanda111 apollo-wuhan weiyangzhang wyzhang421 louieiuol frank96zhang bpux sophiachen23 zwxalgorithm danscheirer zzzjooo wdyfy weil jersinfong bingai tonyweijrvs clu6506 xizhesun0914 rekaiwang qiusi-shen simonzhou96 xiaojinghu nagato1208 starlight4x andyguoxingwang gu4p venjason marinaishere jane-jingjiang birdfly653 gundam1996 kksan riooooorio leoknuth zhengxunwu yupengz bebatman sccotzhao why333 code-talking mingewang tianchuliang capri2014 mengyuan2023 ysscott2012 ngongziprealty huwenyue xiaoningning liketheflower pcchao 0xc9e36 jxlin savadev wenbingz chenxiaogang99527 yaominzh gong2017 leow1986 edison199902222 anniejingchen jiawei-wu dreamingbird zhihuishao asforme song-fang randywang127 liangjz shuhuasong wufan9627 jys168723 shnhrtkyk moran111 meamail cindyrong97 shujian0512 joshzyj haoxu1993 kevinyu98 lilacpp victorwu88 coroline 001425778-zhenyu-jiang pandafriendd liyuan789 jackli31742

leetcode's Issues

关于2311的update max

具体地说，这一行的max是否是必要的呢？
ret初始化的时候离可能的最大值已经仅仅差1，下面的for(int i = m - 1... 循环从最后面开始数的话在遇到第一个check() == true之前，计算出的长度也一直都是小于等于ret初始值的，这里为什么要用max来update它,其实直接赋值就行了吧(尝试去掉max之后依旧可以通过)
https://youtu.be/d20Aw0tB6jw?t=1410 这里也说了(int)s.size() - i >= (int)t.size() - j; 是为了保证位数相等，既然如此max就更没必要了。
对照着文字看懂了大部分代码，看到max彻底懵住，看了一遍视频也没提到。
是我的理解有问题吗，还是testcase太弱？

排版问题

96题的markdown语法导致本该是表达区间的变成了删除线。
原文：
那么左子树必然由节点1k-1组成，左子树必然由节点k+1n组成。接下来左右子树的构建就是一个递归问题。
建议修改：
那么左子树必然由节点[1,k-1]组成，左子树必然由节点[k+1,n]组成。接下来左右子树的构建就是一个递归问题。

关于heap分类的疑惑

大佬，在下不是很明白为什么set的题目放到heap分类 c++的set是用红黑树实现的 priorityqueue才是用heap实现的

函数参数类型不一致

LeetCode/Greedy/452.Minimum-Number-of-Arrows-to-Burst-Balloons/452.Minimum-Number-of-Arrows-to-Burst-Balloons.cpp

Line 7 in 69b113a

int findMinArrowShots(vector<pair<int, int>>& points)

原题的函数定义是 findMinArrowShots(vector<vector<int>>& points)，类型是 vector<vector<int>> ，不是 vector<pair<int, int>>。所以代码里的 first 和 second 对应也需要修改。

我试了下，修改函数会报编译错误。

Line 30: Char 46: error: non-const lvalue reference to type 'vector<pair<int, int>>' cannot bind to a value of unrelated type 'vector<vector<int>>'
      int ret = Solution().findMinArrowShots(param_1); return ret;
                                             ^~~~~~~
Line 7: Char 51: note: passing argument to parameter 'points' here
    int findMinArrowShots(vector<pair<int, int>>& points)
                                                  ^
1 error generated.

PS：是不是关神做的时候题目是 pair 后来改成 vector : )

题目分类表里面的难度评价是否存在疏忽写错之处，如官标简单的168题此评价系统为困难

168题属于进制转换，只是因为没有0会产生一些额外细节，官标为简单，但主页把这个题目评为H，是否原意打E或M出现疏忽？

另外85题需要用到84题的代码，还要先做预处理成84题的情形才能用单调栈来解，难度不应该比84低
449题完全可以直接复制297题的代码，难度不应该比297更高（虽然更好的做法是用前序来序列化，然后用105题的方法还原）

错字

1536题

加入有a和b两行满足条件...

改为假如

1982.Find-Array-Given-Subset-Sums.cpp is TLE

Hello wisdompeak,

Thanks for your sharing! I have learned a lot from your codes. I tried to follow your method for leetcode 1982 but find your solution is now graded as TLE. Which step do you think can be improved in order to get accepted? Once i figured it out, i will close this ticket. Thanks again.
image

多写了个k ?

518 题 README 最后一个代码段，笔误多写了个 k*

for (int i=0; i<coins.size(); i++)
    for (int c=1; c<=amount; c++)
    {        
        dp[c] += dp[c - k*coins[i]];
                        ↑
    }

Leetcode 287 第二种解法

“举个例子：2,4,1,3,1 从index到val的映射关系是：1->2, 2->4, {3,5}->1, 4->3，其中1->2->4->3->1就构成了一个环。可见，这个环的入口就是重复的数字。“

--这种解法应该要用0-index吧，如果用1-index，那么我们考虑比如[2,4,5,1,3,3]这个例子，这里index到val的映射关系是1->2,2->4,3->5,4->1,{5,6}->3, 其中1->2->4->1就构成了一个环，而此时我们如果返回1作为答案的话，这题就错了。而如果用0-index的话，index到val的映射关系变为0->2,1->4,2->5,3->1,{4,5}->3, 其中0->2->5->3->1->4->3也是构成了一个环，而环的入口是3，正是我们所要求的。

可以参考https://www.geeksforgeeks.org/cycle-sort/ 还有 https://leetcode.com/problems/find-the-duplicate-number/discuss/72846 讨论区的一些高票回复。

如果我是哪里没有理解对，也请指出。

关于1655的时间复杂度

群主的解法应该是O(N*m*3^m)吧？里面还有个canSatisfySubset需要O(m)。
在Py3里如果不优化（pre-compute）这块的话会超时。

双指针解法疑问

在双指针解法中，应该考虑的是 A[i] == 0 和 A[i] == 1 的情况，而不是考虑 A[i+1]的取值？

递归更简洁

  1. Count Complete Tree Nodes

class Solution {
public:
int countNodes(TreeNode* root) {
if(!root){
return 0;
}

    int countL=countNodes(root->left);
    int countR=countNodes(root->right);
    return countL+countR+1;

}

};

354 题测试数据加强了

354 题，Russian Doll Envelopes 的数据貌加强了，$1 \leqslant \text{envelopes.length} \leqslant 10^5$ ，$O(N^2)$ 的算法过不了了，我直接把老师你的代码(v1版本)复制粘贴上去直接 TLE 了。（我自己之前提交了AC过的 $O(N^2)$ 的代码现在也 TLE 了。

774关于priority_pueue的优化

LC-774 priority_queue
顺着您的思路做了一些改进（不会TLE了）：先找到整个数据minmax的upper bound，然后在第一次遇到某个pair时，不要减去1，直接减到低于这个upper bound为止。

Example (借用您的代码)

class Solution {
public:
    double minmaxGasDist(vector<int>& stations, int K) 
    {
        priority_queue<pair<double,int>>pq;
        for (int i=1; i<stations.size(); i++)
            pq.push({stations[i]-stations[i-1],1});
        
        double ub = (stations.back() - stations[0]) / (double) (K + 1);
            
        while (K > 0)
        {
            auto [space, insertNum] = pq.top();
            pq.pop();
            int add = 1;
            if (insertNum == 1)
                add = max(1, int(ceil(space/ub) - 1));
            K -= add;
            pq.push({space*insertNum/(insertNum+add),insertNum+add});            
        }
        
        return pq.top().first;
    }
};

Leetcode 156 直接递归，代码更简洁直观。

class Solution156 {
public:
TreeNode* upsideDownBinaryTree(TreeNode* root) {
if (!root) return nullptr;
if (!root->left && !root->right) return root;
TreeNode* trueRoot = upsideDownBinaryTree(root->left);
//update the new branches
root->left->left = root->right;
root->left->right = root;
root->left = nullptr;
root->right = nullptr;
return trueRoot;

}

};

1017.Convert-to-Base--2，少了一个负号

比如说5/(-3)，结果商是-1，余数是-2.这个余数因为是负数，是无法用来作为进制转换结果的。
来自这里
本机测试5 % (-3)的输出为2，这里是否想表达-5/-3来得到-2？

关于二分查找代码的疑问

你好，请问如下问题，在二分查找的代码中，计算mid有两种写法：
int mid = low+(high-low)/2;
int mid = right-(right-left)/2;

这两种写法分别对应什么情况？能稍微解释一下吗？

关于2141

这里的cur >= T永远不会大于2*T吧，按理说没必要用while，用if就够了,是测试例子太弱还是我的理解有问题？

Question about the for loop condition to efficientlly iterate all subset

Hi wisdompeak,

In the README.md, you mentioned a template

  for (int state=1; state<(1<<n); state++)  
      for (int subset=state; subset>0; subset=(subset-1)&state)
      {
          dp[state] = DoSomething(dp[subset]);
      }

The inner for loop condition implies when (subset-1&state) == 0, there's no need to search the next subset with the same state.

However, I'm confuse about the reason, would you please explain it or give me some hint?
Thanks.

关于2337.Move-Pieces-to-Obtain-a-String 是否说反了？

因为target里的L必须是从start里对应的L向右移动得到，所以另一个必要条件就是查看他们的初始位置：start里的L必须比target里对应的L更靠左。同理，start里的R必须比target里对应的R更靠右。

来自这里

题目里写的是:

片段 'L' 只有在其左侧直接存在一个 空位 时才能向 左 移动，而片段 'R' 只有在其右侧直接存在一个 空位 时才能向 右 移动。

我看了代码

if (start[i] == 'L' && i < j)

这句是为了保证target里某个L所在的index比start 靠左，对吗？
没看视频，因为您的文字版向来简洁精炼，不知道视频怎么讲的 >_<

699 解法1 更新 right+1 边界时，未考虑是否会破坏原 right +1

测试数据

测试用例：[[1,1],[2,5],[1,1],[2,5]]
预计输出：[1, 5, 5, 10]
实际输出：[1, 5, 5, 6]

文字描述

map[2] 原为 5，第二个 [1,1] 更新时，会将 map[2] 更新为 1 （原 map[1]）
导致 第二个 [2,5] 将 map[2] 更新为 6 = (2 + 5)，实际应是 10 = (5 +5)

map 更新过程：

0 0
1 1
2 0
2147483647 0

0 0
1 1
2 5
7 0
2147483647 0

0 0
1 2
2 1
7 0
2147483647 0

0 0
1 2
2 6
7 1
2147483647 0

805题第二种做法

805题第二种做法 805.Split-Array-With-Same-Average_DP2.cpp 好像没有考虑到全零并且长度大于1的test case，比如[0, 0, 0, 0, 0]，在第20行if (sum*n%total!=0) continue;处会出现division by zero的错误。

2096，依照老师的c++代码，改成java后提交不通过。请看看哪里出了问题？ 

   public String getDirections(TreeNode root, int startValue, int destValue) {
      List<Integer> nums1 = new ArrayList<>();
      List<Integer> nums2 = new ArrayList<>();
      List<Character> dirs1 = new ArrayList<>();
      List<Character> dirs2 = new ArrayList<>();
      dfs(root, nums1, dirs1, startValue);
      dfs(root, nums2, dirs2, destValue);

      int k = 0;
      while (k<nums1.size() && k<nums2.size() && nums1.get(k)==nums2.get(k))
          k++;
      for (int i=k; i<dirs1.size(); i++) dirs1.set(i,'U');

      StringBuilder str = new StringBuilder();
      for (Character character : dirs1.subList(k,dirs1.size())) {
          str.append(character);
      }
      for (Character character : dirs2.subList(k,dirs2.size())) {
          str.append(character);
      }
      return str.toString();
  }

  private boolean dfs(TreeNode node, List<Integer> nums, List<Character> dirs, int target) {
      if (node==null) return false;
      if (node.val == target) return true;
      if (node.left!=null)
      {
          nums.add(node.left.val);
          dirs.add('L');
          if (dfs(node.left, nums, dirs, target))
              return true;
          nums.remove(nums.size()-1);
          dirs.remove(dirs.size()-1);
      }
      if (node.right!=null)
      {
          nums.add(node.right.val);
          dirs.add('R');
          if (dfs(node.right, nums, dirs, target))
              return true;
          nums.remove(nums.size()-1);
          dirs.remove(dirs.size()-1);
      }
      return false;
  }

The Template of SegmentTree may be wrong?

https://github.com/wisdompeak/LeetCode/blob/master/Template/SegmentTree/range_sum.cpp#L33
In the PushDown method of RangeSum temlpate, the code just simply copy the parent's info to childrens', which is wrong.

I test it by the following code

int main(){
    SegTreeNode* root = new SegTreeNode(0, 10, 0);
  
    root->updateRange(5, 10, 20);

    assert(root->queryRange(6,6) == 20); // where the template gives us 40
}

We could fix this by introducing lazy_val as the member variable.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.