Skip to content

Commit 9a71ec1

Browse files
yanglbmeyanglbme
committed
docs: update SOLUTION_TREE
See https://github.com/doocs/leetcode/blob/master/SOLUTION_TREE.md
1 parent 6368ca6 commit 9a71ec1

File tree

3 files changed

+83
-8
lines changed

3 files changed

+83
-8
lines changed

‎README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ See [SOLUTION_TREE](/SOLUTION_TREE.md).
2222

2323
## Contributions
2424
I'm looking for long-term contributors/partners to this repo! Send me [PRs](https://github.com/doocs/leetcode/pulls) if you're interested! See the following:
25-
- <kbd>Fork</kbd> [this repository](https://github.com/doocs/leetcode) to your own GitHub account and then <kbd>[clone](https://help.github.com/articles/cloning-a-repository/)</kbd> it to your local machine.
25+
- <kbd>Fork</kbd> [this repository](https://github.com/doocs/leetcode) to your own GitHub account and then <kbd>clone</kbd> it to your local machine.
2626
- Make some changes to your leetcode repository, then <kbd>add</kbd>, <kbd>commit</kbd> and <kbd>push</kbd> it to your remote GitHub repository.
2727
- Submit a pull request with your changes!
2828
- See [CONTRIBUTING](/.github/CONTRIBUTING.md) for more details.
@@ -32,4 +32,4 @@ I'm looking for long-term contributors/partners to this repo! Send me [PRs](http
3232
## Contributors
3333
This project exists thanks to all the people who contribute.
3434

35-
<a href="https://github.com/doocs/leetcode/graphs/contributors"><img src="https://opencollective.com/doocs-leetcode/contributors.svg?width=890&button=false" /></a>
35+
<a href="https://opencollective.com/doocs-leetcode/contributors.svg?width=890&button=true"><img src="https://opencollective.com/doocs-leetcode/contributors.svg?width=890&button=false" /></a>

‎SOLUTION_TREE.md

Lines changed: 81 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -409,7 +409,8 @@
409409
├── 0099.Recover Binary Search Tree
410410
│   └── Solution.java
411411
├── 0100.Same Tree
412-
│   └── Solution.java
412+
│   ├── Solution.java
413+
│   └── Solution.py
413414
├── 0101.Symmetric Tree
414415
│   ├── Solution.java
415416
│   └── Solution.js
@@ -419,10 +420,13 @@
419420
│   ├── Solution.js
420421
│   └── Solution.py
421422
├── 0103.Binary Tree Zigzag Level Order Traversal
422-
│   └── Solution.java
423+
│   ├── Solution.java
424+
│   └── Solution.py
423425
├── 0104.Maximum Depth of Binary Tree
424426
│   ├── Solution.java
425-
│   └── Solution.js
427+
│   ├── Solution.js
428+
│   ├── Solution.py
429+
│   └── new.md
426430
├── 0105.Construct Binary Tree from Preorder and Inorder Traversal
427431
│   ├── README.md
428432
│   ├── Solution.cpp
@@ -637,6 +641,8 @@
637641
├── 0200.Number of Islands
638642
│   ├── README.md
639643
│   └── Solution.py
644+
├── 0201.Bitwise AND of Numbers Range
645+
│   └── Solution.java
640646
├── 0202.Happy Number
641647
│   ├── README.md
642648
│   └── Solution.java
@@ -664,6 +670,8 @@
664670
│   ├── README.md
665671
│   ├── Solution.cpp
666672
│   └── Solution.py
673+
├── 0229.Majority Element II
674+
│   └── Solution.java
667675
├── 0231.Power of Two
668676
│   ├── README.md
669677
│   ├── Solution.java
@@ -682,6 +690,12 @@
682690
│   └── Solution.py
683691
├── 0242.Valid Anagram
684692
│   └── Solution.js
693+
├── 0260.Single Number III
694+
│   └── Solution.java
695+
├── 0263.Ugly Number
696+
│   └── Solution.java
697+
├── 0264.Ugly Number II
698+
│   └── Solution.java
685699
├── 0268.Missing Number
686700
│   ├── Solution.js
687701
│   └── Solution2.js
@@ -705,13 +719,17 @@
705719
│   └── Solution.java
706720
├── 0318.Maximum Product of Word Lengths
707721
│   └── Solution.cpp
722+
├── 0319.Bulb Switcher
723+
│   └── Solution.java
708724
├── 0326.Power of Three
709725
│   └── Solution.js
710726
├── 0328.Odd Even Linked List
711727
│   ├── README.md
712728
│   └── Solution.java
713729
├── 0329.Longest Increasing Path in a Matrix
714730
│   └── Solution.cpp
731+
├── 0331.Verify Preorder Serialization of a Binary Tree
732+
│   └── Solution.java
715733
├── 0343.Integer Break
716734
│   ├── README.md
717735
│   └── Solution.java
@@ -724,6 +742,8 @@
724742
│   └── Solution.py
725743
├── 0350.Intersection of Two Arrays II
726744
│   └── Solution.js
745+
├── 0371.Sum of Two Integers
746+
│   └── Solution.java
727747
├── 0384.Shuffle an Array
728748
│   └── Solution.js
729749
├── 0387.First Unique Character in a String
@@ -734,10 +754,16 @@
734754
├── 0394.Decode String
735755
│   ├── README.md
736756
│   └── Solution.py
757+
├── 0397.Integer Replacement
758+
│   └── Solution.java
759+
├── 0401.Binary Watch
760+
│   └── Solution.java
737761
├── 0412.Fizz Buzz
738762
│   ├── Solution.cpp
739763
│   ├── Solution.js
740764
│   └── Solution.py
765+
├── 0415.Add Strings
766+
│   └── Solution.java
741767
├── 0423.Reconstruct Original Digits from English
742768
│   └── Solution.cpp
743769
├── 0427.Construct Quad Tree
@@ -773,6 +799,8 @@
773799
├── 0521.Longest Uncommon Subsequence I
774800
│   ├── README.md
775801
│   └── Solution.py
802+
├── 0542.01 Matrix
803+
│   └── Solution.java
776804
├── 0554.Brick Wall
777805
│   ├── README.md
778806
│   └── Solution.py
@@ -784,6 +812,9 @@
784812
│   └── Solution.py
785813
├── 0572.Subtree of Another Tree
786814
│   └── Solution.cpp
815+
├── 0576.
816+
│   └── Out of Boundary Paths
817+
│   └── Solution.java
787818
├── 0581.Shortest Unsorted Continuous Subarray
788819
│   ├── README.md
789820
│   ├── Solution.cpp
@@ -797,10 +828,14 @@
797828
│   ├── Solution.cpp
798829
│   ├── Solution.java
799830
│   └── Solution.py
831+
├── 0606.Construct String from Binary Tree
832+
│   └── Solution.java
800833
├── 0620.Not Boring Movies
801834
│   └── README.md
802835
├── 0627.Swap Salary
803836
│   └── README.md
837+
├── 0652.Find Duplicate Subtrees
838+
│   └── Solution.java
804839
├── 0657.Robot Return to Origin
805840
│   └── Solution.py
806841
├── 0665.Non-decreasing Array
@@ -809,6 +844,8 @@
809844
├── 0670.Maximum Swap
810845
│   ├── README.md
811846
│   └── Solution.py
847+
├── 0687.Longest Univalue Path
848+
│   └── Solution.java
812849
├── 0695.Max Area of Island
813850
│   ├── README.md
814851
│   ├── Solution.cpp
@@ -830,14 +867,25 @@
830867
├── 0735.Asteroid Collision
831868
│   ├── README.md
832869
│   └── Solution.py
870+
├── 0739.Daily Temperatures
871+
│   └── Solution.java
872+
├── 0746.Min Cost Climbing Stairs
873+
│   └── Solution.java
833874
├── 0762.Prime Number of Set Bits in Binary Representation
834875
│   ├── README.md
835876
│   └── Solution.py
836877
├── 0769.Max Chunks To Make Sorted
837878
│   ├── README.md
838879
│   └── Solution.py
839880
├── 0771.Jewels and Stones
881+
│   ├── Solution.cpp
840882
│   └── Solution.py
883+
├── 0777.Swap Adjacent in LR String
884+
│   └── Solution.java
885+
├── 0783.Minimum Distance Between BST Nodes
886+
│   └── Solution.java
887+
├── 0784.Letter Case Permutation
888+
│   └── Solution.java
841889
├── 0789.Escape The Ghosts
842890
│   ├── README.md
843891
│   └── Solution.py
@@ -882,6 +930,8 @@
882930
├── 0889.Construct Binary Tree from Preorder and Postorder Traversal
883931
│   ├── README.md
884932
│   └── Solution.py
933+
├── 0898.Bitwise ORs of Subarrays
934+
│   └── Solution.java
885935
├── 0905.Sort Array By Parity
886936
│   ├── README.md
887937
│   ├── Solution.js
@@ -902,6 +952,8 @@
902952
│   └── Solution.py
903953
├── 0930.Binary Subarrays With Sum
904954
│   └── Solution.js
955+
├── 0931.Minimum Falling Path Sum
956+
│   └── Solution.java
905957
├── 0938.Range Sum of BST
906958
│   ├── README.md
907959
│   ├── Solution.cpp
@@ -929,7 +981,8 @@
929981
│   ├── Solution.js
930982
│   ├── Solution.py
931983
│   ├── Solution2.cpp
932-
│   └── Solution2.py
984+
│   ├── Solution2.py
985+
│   └── Solution3.cpp
933986
├── 0965.Univalued Binary Tree
934987
│   └── Solution.cpp
935988
├── 0976.Largest Perimeter Triangle
@@ -944,6 +997,8 @@
944997
│   ├── Solution.cpp
945998
│   ├── Solution.js
946999
│   └── Solution.py
1000+
├── 0989.Add to Array-Form of Integer
1001+
│   └── Solution.java
9471002
├── 1005.Maximize Sum Of Array After K Negations
9481003
│   └── Solution.py
9491004
├── 1006.Clumsy Factorial
@@ -978,6 +1033,26 @@
9781033
│   └── Solution.cpp
9791034
├── 1027.Longest Arithmetic Sequence
9801035
│   └── Solution.cpp
981-
└── 1028.Recover a Tree From Preorder Traversal
982-
└── Solution.cpp
1036+
├── 1028.Recover a Tree From Preorder Traversal
1037+
│   └── Solution.cpp
1038+
├── 1033.Moving Stones Until Consecutive
1039+
│   └── Solution.java
1040+
├── 1034.Coloring A Border
1041+
│   └── Solution.java
1042+
├── 5075.Number of Submatrices That Sum to Target
1043+
│   └── Solution.py
1044+
├── 5076.Greatest Common Divisor of Strings
1045+
│   └── Solution.py
1046+
├── 5077.Flip Columns For Maximum Number of Equal Rows
1047+
│   └── Solution.py
1048+
├── 5078.Adding Two Negabinary Numbers
1049+
│   └── Solution.py
1050+
├── 5083.Occurrences After Bigram
1051+
│   └── Solution.py
1052+
├── 5084.Insufficient Nodes in Root to Leaf Paths
1053+
│   └── Solution.py
1054+
├── 5086.Smallest Subsequence of Distinct Characters
1055+
│   └── Solution.py
1056+
└── 5087.Letter Tile Possibilities
1057+
└── Solution.py
9831058
```

‎solution/0576./Out of Boundary Paths/Solution.java renamed to ‎solution/0576.Out of Boundary Paths/Solution.java

File renamed without changes.

0 commit comments

Comments
 (0)