Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

💯 My LeetCode Problem's Solutions(Golang).

License

NotificationsYou must be signed in to change notification settings

WindomZ/leetcode.go

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

My solutions(Golang) of problems inhttps://leetcode.com/

Build StatusCoverage StatusGo Report CardFOSSA Status

Pursue

  • Faster andBetter solutions.
  • 100% coverage tests.
  • 100% benchmark tests.

Catalog

Support

If you like it then you can put a ⭐Star on it.

Solutions

'Single Repetition Duration' and 'LeetCode Run Time' are forreference only.

#Problem &SolutionDifficultySingle Repetition DurationLeetCode Run Time
108Convert Sorted Array to Binary Search TreeEasy138 ns/op /5 test cases204 ms
107Binary Tree Level Order Traversal IIEasy102 ns/op /3 test cases8 ms
106Construct Binary Tree from Inorder and Postorder TraversalMedium60.0 ns/op /3 test cases32 ms
105Construct Binary Tree from Preorder and Inorder TraversalMedium60.0 ns/op /3 test cases36 ms
104Maximum Depth of Binary TreeEasy18.7 ns/op /5 test cases8 ms
103Binary Tree Zigzag Level Order TraversalMedium78.6 ns/op /3 test cases0 ms
102Binary Tree Level Order TraversalMedium76.0 ns/op /3 test cases8 ms
101Symmetric TreeEasy17.6 ns/op /5 test cases4 ms
100Same TreeEasy9.12 ns/op /6 test cases0 ms
99Recover Binary Search TreeHard94.8 ns/op /3 test cases32 ms
98Validate Binary Search TreeMedium21.0 ns/op /8 test cases8 ms
96Unique Binary Search TreesMedium39.1 ns/op /6 test cases0 ms
95Unique Binary Search Trees IIMedium259 ns/op /3 test cases48 ms
94Binary Tree Inorder TraversalMedium119 ns/op /3 test cases0 ms
93Restore IP AddressesMedium251 ns/op /4 test cases4 ms
92Reverse Linked List IIMedium61.5 ns/op /3 test cases3 ms
91Decode WaysMedium68.3 ns/op /8 test cases3 ms
90Subsets IIMedium326 ns/op /5 test cases9 ms
89Gray CodeMedium88.6 ns/op /6 test cases9 ms
88Merge Sorted ArrayEasy9.00 ns/op /6 test cases3 ms
86Partition ListMedium89.1 ns/op /3 test cases3 ms
83Remove Duplicates from Sorted ListEasy93.0 ns/op /6 test cases9 ms
82Remove Duplicates from Sorted List IIMedium9.62 ns/op /6 test cases6 ms
81Search in Rotated Sorted Array IIMedium11.7 ns/op /12 test cases9 ms
80Remove Duplicates from Sorted Array IIMedium9.82 ns/op /6 test cases12 ms
79Word SearchMedium73.3 ns/op /6 test cases6 ms
78SubsetsMedium447 ns/op /5 test cases6 ms
77CombinationsMedium336 ns/op /6 test cases246 ms
75Sort ColorsMedium13.4 ns/op /6 test cases3 ms
74Search a 2D MatrixMedium32.5 ns/op /6 test cases16 ms
73Set Matrix ZeroesMedium22.0 ns/op /6 test cases42 ms
71Simplify PathMedium382 ns/op /6 test cases3 ms
70Climbing StairsEasy7.59 ns/op /9 test cases0 ms
69Sqrt(x)Easy27.6 ns/op /8 test cases6 ms
67Add BinaryEasy84.0 ns/op /5 test cases3 ms
66Plus OneEasy29.8 ns/op /6 test cases3 ms
65Valid NumberHard46.3 ns/op /8 test cases9 ms
64Minimum Path SumMedium48.4 ns/op /5 test cases16 ms
63Unique Paths IIMedium36.3 ns/op /5 test cases3 ms
62Unique PathsMedium5.51 ns/op /11 test cases0 ms
61Rotate ListMedium34.0 ns/op /2 test cases6 ms
60Permutation SequenceMedium73.9 ns/op /6 test cases3 ms
59Spiral Matrix IIMedium82.1 ns/op /3 test cases0 ms
58Length of Last WordEasy4.02 ns/op /5 test cases0 ms
56Merge IntervalsMedium154 ns/op /5 test cases19 ms
55Jump GameMedium7.32 ns/op /6 test cases19 ms
54Spiral MatrixMedium45.5 ns/op /3 test cases0 ms
53Maximum SubarrayEasy10.3 ns/op /6 test cases12 ms
50Pow(x, n)Medium7.31 ns/op /12 test cases3 ms
49Group AnagramsMedium313 ns/op /3 test cases582 ms
48Rotate ImageMedium12.1 ns/op /3 test cases3 ms
47Permutations IIMedium198 ns/op /3 test cases19 ms
46PermutationsMedium484 ns/op /3 test cases9 ms
45Jump Game IIHard5.14 ns/op /6 test cases19 ms
44Wildcard MatchingHard10.9 ns/op /9 test cases15 ms
43Multiply StringsMedium53.4 ns/op /6 test cases3 ms
42Trapping Rain WaterHard14.4 ns/op /6 test cases6 ms
41First Missing PositiveHard12.3 ns/op /6 test cases3 ms
40Combination Sum IIMedium203 ns/op /3 test cases3 ms
39Combination SumMedium165 ns/op /3 test cases6 ms
38Count and SayEasy66.8 ns/op /4 test cases0 ms
37Sudoku SolverHard35497 ns/op /2 test cases0 ms
36Valid SudokuMedium135 ns/op /3 test cases6 ms
35Search Insert PositionEasy7.76 ns/op /8 test cases6 ms
34Search for a RangeMedium53.5 ns/op /8 test cases19 ms
33Search in Rotated Sorted ArrayMedium30.0 ns/op /8 test cases3 ms
32Longest Valid ParenthesesHard78.9 ns/op /8 test cases3 ms
31Next PermutationMedium2.97 ns/op /4 test cases6 ms
30Substring with Concatenation of All WordsHard331 ns/op /3 test cases13 ms
29Divide Two IntegersMedium63.2 ns/op /12 test cases6 ms
28Implement strStr()Easy9.29 ns/op /7 test cases0 ms
27Remove ElementEasy8.75 ns/op /6 test cases3 ms
26Remove Duplicates from Sorted ArrayEasy9.51 ns/op /6 test cases102 ms
25Reverse Nodes in k-GroupHard58.6 ns/op /3 test cases9 ms
24Swap Nodes in PairsMedium62.1 ns/op /4 test cases0 ms
23Merge k Sorted ListsHard88.7 ns/op /4 test cases19 ms
22Generate ParenthesesMedium340 ns/op /4 test cases13 ms
21Merge Two Sorted ListsEasy89.0 ns/op /3 test cases3 ms
20Valid ParenthesesEasy28.9 ns/op /6 test cases0 ms
19Remove Nth Node From End of ListMedium97.3 ns/op /6 test cases3 ms
184SumMedium233 ns/op /3 test cases16 ms
17Letter Combinations of a Phone NumberMedium407 ns/op /4 test cases0 ms
163Sum ClosestMedium379 ns/op /8 test cases9 ms
153SumMedium183 ns/op /4 test cases1525 ms
14Longest Common PrefixEasy10.6 ns/op /8 test cases3 ms
13Roman to IntegerEasy16.9 ns/op /8 test cases19 ms
12Integer to RomanMedium26.4 ns/op /8 test cases22 ms
11Container With Most WaterMedium7.84 ns/op /5 test cases25 ms
10Regular Expression MatchingHard183 ns/op /6 test cases3 ms
9Palindrome NumberEasy6.37 ns/op /7 test cases55 ms
8String to Integer (atoi)Medium7.31 ns/op /5 test cases3 ms
7Reverse IntegerEasy9.00 ns/op /5 test cases3 ms
6ZigZag ConversionMedium55.1 ns/op /5 test cases9 ms
5Longest Palindromic SubstringMedium39.1 ns/op /6 test cases9 ms
4Median of Two Sorted ArraysHard19.4 ns/op /14 test cases32 ms
3Longest Substring Without Repeating CharactersMedium21.3 ns/op /3 test cases6 ms
2Add Two NumbersMedium19.4 ns/op /1 test cases29 ms
1Two SumEasy79.5 ns/op /3 test cases6 ms

All tests should be run on asame machine, and throughmultiple benchmark tests.

Testing

git clone https://github.com/WindomZ/leetcode.go.git"$YOUR_PROJECT_PATH"cd"$YOUR_PROJECT_PATH"gotest -v -run=. ./solutions/...gotest -bench=. -benchmem ./solutions/...

Related

Helper

Contributing

Challenge

Welcome topull requests(PRs) of thebetter solutions.

  1. Pass all LeetCode test cases.
  2. Pass all my test cases.
  3. Faster than mine! (on a machine, and run benchmark tests repeatedly)

Discuss

Welcome to report bugs, suggest ideas and discuss onissues page.

License

FOSSA Status

About

💯 My LeetCode Problem's Solutions(Golang).

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors2

  •  
  •  
[8]ページ先頭
©2009-2025 Movatter.jp