Skip to content

frostforestcdjl/Algorithm__LeetCode_python_solution

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

412 Commits
0001. Two Sum.py
0001. Two Sum.py
 
 
0002M. Add Two Numbers.py
0002M. Add Two Numbers.py
 
 
0003M. Longest Substring Without Repeating Characters.py
0003M. Longest Substring Without Repeating Characters.py
 
 
0004H. Median of Two Sorted Arrays.py
0004H. Median of Two Sorted Arrays.py
 
 
0005M. Longest Palindromic Substring.py
0005M. Longest Palindromic Substring.py
 
 
0006M. ZigZag Conversion.py
0006M. ZigZag Conversion.py
 
 
0007. Reverse Integer.py
0007. Reverse Integer.py
 
 
0009. Palindrome Number.py
0009. Palindrome Number.py
 
 
0011M(ref). Container With Most Water.py
0011M(ref). Container With Most Water.py
 
 
0012M. Integer to Roman.py
0012M. Integer to Roman.py
 
 
0013. Roman to Integer.py
0013. Roman to Integer.py
 
 
0014. Longest Common Prefix.py
0014. Longest Common Prefix.py
 
 
0015M(ref). 3Sum.py
0015M(ref). 3Sum.py
 
 
0017Ｍ. Letter Combinations of a Phone Number.py
0017Ｍ. Letter Combinations of a Phone Number.py
 
 
0019M. Remove Nth Node From End of List.py
0019M. Remove Nth Node From End of List.py
 
 
0020. Valid Parentheses.py
0020. Valid Parentheses.py
 
 
0021. Merge Two Sorted Lists.py
0021. Merge Two Sorted Lists.py
 
 
0022M. Generate Parentheses.py
0022M. Generate Parentheses.py
 
 
0023H. Merge k Sorted Lists.py
0023H. Merge k Sorted Lists.py
 
 
0025H. Reverse Nodes in k-Group.py
0025H. Reverse Nodes in k-Group.py
 
 
0026. Remove Duplicates from Sorted Array.py
0026. Remove Duplicates from Sorted Array.py
 
 
0027. Remove Element.py
0027. Remove Element.py
 
 
0028. Implement strStr().py
0028. Implement strStr().py
 
 
0029M. Divide Two Integers.py
0029M. Divide Two Integers.py
 
 
0030H. Substring with Concatenation of All Words.py
0030H. Substring with Concatenation of All Words.py
 
 
0031M. Next Permutation.py
0031M. Next Permutation.py
 
 
0032H. Longest Valid Parentheses.py
0032H. Longest Valid Parentheses.py
 
 
0033M. Search in Rotated Sorted Array.py
0033M. Search in Rotated Sorted Array.py
 
 
0034M. Find First and Last Position of Element in Sorted Array.py
0034M. Find First and Last Position of Element in Sorted Array.py
 
 
0035. Search Insert Position.py
0035. Search Insert Position.py
 
 
0036M. Valid Sudoku.py
0036M. Valid Sudoku.py
 
 
0038M. Count and Say.py
0038M. Count and Say.py
 
 
0039M. Combination Sum.py
0039M. Combination Sum.py
 
 
0041H. First Missing Positive.py
0041H. First Missing Positive.py
 
 
0042H. Trapping Rain Water.py
0042H. Trapping Rain Water.py
 
 
0043M. Multiply Strings.py
0043M. Multiply Strings.py
 
 
0045M. Jump Game II.py
0045M. Jump Game II.py
 
 
0046M. Permutations.py
0046M. Permutations.py
 
 
0047M. Permutations II.py
0047M. Permutations II.py
 
 
0048M. Rotate Image.py
0048M. Rotate Image.py
 
 
0049M. Group Anagrams.py
0049M. Group Anagrams.py
 
 
0050M. Pow(x, n).py
0050M. Pow(x, n).py
 
 
0053. Maximum Subarray.py
0053. Maximum Subarray.py
 
 
0054M. Spiral Matrix.py
0054M. Spiral Matrix.py
 
 
0055M. Jump Game.py
0055M. Jump Game.py
 
 
0056M. Merge Intervals.py
0056M. Merge Intervals.py
 
 
0057M. Insert Interval.py
0057M. Insert Interval.py
 
 
0058. Length of Last Word.py
0058. Length of Last Word.py
 
 
0059M. Spiral Matrix II.py
0059M. Spiral Matrix II.py
 
 
0060H. Permutation Sequence.py
0060H. Permutation Sequence.py
 
 
0061M. Rotate List.py
0061M. Rotate List.py
 
 
0062M. Unique Paths.py
0062M. Unique Paths.py
 
 
0063M. Unique Paths II.py
0063M. Unique Paths II.py
 
 
0064M. Minimum Path Sum.py
0064M. Minimum Path Sum.py
 
 
0065H. Valid Number.py
0065H. Valid Number.py
 
 
0066. Plus One.py
0066. Plus One.py
 
 
0067. Add Binary.py
0067. Add Binary.py
 
 
0068H. Text Justification.py
0068H. Text Justification.py
 
 
0069. Sqrt(x).py
0069. Sqrt(x).py
 
 
0070. Climbing Stairs.py
0070. Climbing Stairs.py
 
 
0071M. Simplify Path.py
0071M. Simplify Path.py
 
 
0073M. Set Matrix Zeroes.py
0073M. Set Matrix Zeroes.py
 
 
0074M. Search a 2D Matrix.py
0074M. Search a 2D Matrix.py
 
 
0075M. Sort Colors.py
0075M. Sort Colors.py
 
 
0077M. Combinations.py
0077M. Combinations.py
 
 
0078M. Subsets.py
0078M. Subsets.py
 
 
0080M. Remove Duplicates from Sorted Array II.py
0080M. Remove Duplicates from Sorted Array II.py
 
 
0081M. Search in Rotated Sorted Array II.py
0081M. Search in Rotated Sorted Array II.py
 
 
0082M. Remove Duplicates from Sorted List II.py
0082M. Remove Duplicates from Sorted List II.py
 
 
0083. Remove Duplicates from Sorted List.py
0083. Remove Duplicates from Sorted List.py
 
 
0086M. Partition List.py
0086M. Partition List.py
 
 
0088. Merge Sorted Array.py
0088. Merge Sorted Array.py
 
 
0090M. Subsets II.py
0090M. Subsets II.py
 
 
0092M. Reverse Linked List II.py
0092M. Reverse Linked List II.py
 
 
0093M. Restore IP Addresses.py
0093M. Restore IP Addresses.py
 
 
0094. Binary Tree Inorder Traversal.py
0094. Binary Tree Inorder Traversal.py
 
 
0100. Same Tree.py
0100. Same Tree.py
 
 
0101. Symmetric Tree.py
0101. Symmetric Tree.py
 
 
0104. Maximum Depth of Binary Tree.py
0104. Maximum Depth of Binary Tree.py
 
 
0110. Balanced Binary Tree.py
0110. Balanced Binary Tree.py
 
 
0111. Minimum Depth of Binary Tree.py
0111. Minimum Depth of Binary Tree.py
 
 
0113M. Path Sum II.py
0113M. Path Sum II.py
 
 
0116M. Populating Next Right Pointers in Each Node.py
0116M. Populating Next Right Pointers in Each Node.py
 
 
0118. Pascal's Triangle.py
0118. Pascal's Triangle.py
 
 
0119. Pascal's Triangle II.py
0119. Pascal's Triangle II.py
 
 
0120M. Triangle.py
0120M. Triangle.py
 
 
0121. Best Time to Buy and Sell Stock.py
0121. Best Time to Buy and Sell Stock.py
 
 
0122. Best Time to Buy and Sell Stock II.py
0122. Best Time to Buy and Sell Stock II.py
 
 
0125. Valid Palindrome.py
0125. Valid Palindrome.py
 
 
0128M. Longest Consecutive Sequence.py
0128M. Longest Consecutive Sequence.py
 
 
0129M. Sum Root to Leaf Numbers.py
0129M. Sum Root to Leaf Numbers.py
 
 
0130M. Surrounded Regions.py
0130M. Surrounded Regions.py
 
 
0133H. Clone Graph.py
0133H. Clone Graph.py
 
 
0134M. Gas Station.py
0134M. Gas Station.py
 
 
0136. Single Number.py
0136. Single Number.py
 
 
0137M. Single Number II.py
0137M. Single Number II.py
 
 
0141. Linked List Cycle.py
0141. Linked List Cycle.py
 
 
0142M. Linked List Cycle II.py
0142M. Linked List Cycle II.py
 
 
0143M. Reorder List.py
0143M. Reorder List.py
 
 
0144. Binary Tree Preorder Traversal.py
0144. Binary Tree Preorder Traversal.py
 
 

Repository files navigation

archive_LeetCode

@@ LeetCode Solution Progress: @@
+ Easy:211/511
! Medium:72/1043 + 2(ref)
- Hard:10/419

file_name = language + title_number + hardness(M or H) + (ref) + title_name

file_name discription
language '' == Python, 'Q' == SQL.
title_number supplement to 4 digits for ordering with numbers.
hardness '' == easy, 'M' == Medium, 'H' == Hard.
(ref) the code is refered to other's, not by myself.
title_name the problem's name.

About

LeetCode solution

Topics

leetcode-solutions leetcode-python

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

1 tags

Packages

No packages published

Languages