LeetCode AC Solution

All files were automatically downloaded using spider wrote by myself.

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
001. Two Sum		001. Two Sum
002. Add Two Numbers		002. Add Two Numbers
003. Longest Substring Without Repeating Characters		003. Longest Substring Without Repeating Characters
004. Median of Two Sorted Arrays		004. Median of Two Sorted Arrays
007. Reverse Integer		007. Reverse Integer
009. Palindrome Number		009. Palindrome Number
011. Container With Most Water		011. Container With Most Water
012. Integer to Roman		012. Integer to Roman
013. Roman to Integer		013. Roman to Integer
014. Longest Common Prefix		014. Longest Common Prefix
017. Letter Combinations of a Phone Number		017. Letter Combinations of a Phone Number
019. Remove Nth Node From End of List		019. Remove Nth Node From End of List
020. Valid Parentheses		020. Valid Parentheses
021. Merge Two Sorted Lists		021. Merge Two Sorted Lists
022. Generate Parentheses		022. Generate Parentheses
023. Merge k Sorted Lists		023. Merge k Sorted Lists
024. Swap Nodes in Pairs		024. Swap Nodes in Pairs
025. Reverse Nodes in k-Group		025. Reverse Nodes in k-Group
026. Remove Duplicates from Sorted Array		026. Remove Duplicates from Sorted Array
027. Remove Element		027. Remove Element
028. Implement strStr()		028. Implement strStr()
030. Substring with Concatenation of All Words		030. Substring with Concatenation of All Words
031. Next Permutation		031. Next Permutation
033. Search in Rotated Sorted Array		033. Search in Rotated Sorted Array
034. Search for a Range		034. Search for a Range
035. Search Insert Position		035. Search Insert Position
036. Valid Sudoku		036. Valid Sudoku
039. Combination Sum		039. Combination Sum
040. Combination Sum II		040. Combination Sum II
041. First Missing Positive		041. First Missing Positive
043. Multiply Strings		043. Multiply Strings
046. Permutations		046. Permutations
047. Permutations II		047. Permutations II
048. Rotate Image		048. Rotate Image
049. Group Anagrams		049. Group Anagrams
053. Maximum Subarray		053. Maximum Subarray
054. Spiral Matrix		054. Spiral Matrix
055. Jump Game		055. Jump Game
056. Merge Intervals		056. Merge Intervals
057. Insert Interval		057. Insert Interval
058. Length of Last Word		058. Length of Last Word
059. Spiral Matrix II		059. Spiral Matrix II
060. Permutation Sequence		060. Permutation Sequence
061. Rotate List		061. Rotate List
062. Unique Paths		062. Unique Paths
063. Unique Paths II		063. Unique Paths II
064. Minimum Path Sum		064. Minimum Path Sum
066. Plus One		066. Plus One
067. Add Binary		067. Add Binary
069. Sqrt(x)		069. Sqrt(x)
070. Climbing Stairs		070. Climbing Stairs
071. Simplify Path		071. Simplify Path
073. Set Matrix Zeroes		073. Set Matrix Zeroes
075. Sort Colors		075. Sort Colors
077. Combinations		077. Combinations
078. Subsets		078. Subsets
080. Remove Duplicates from Sorted Array II		080. Remove Duplicates from Sorted Array II
081. Search in Rotated Sorted Array II		081. Search in Rotated Sorted Array II
082. Remove Duplicates from Sorted List II		082. Remove Duplicates from Sorted List II
083. Remove Duplicates from Sorted List		083. Remove Duplicates from Sorted List
088. Merge Sorted Array		088. Merge Sorted Array
090. Subsets II		090. Subsets II
092. Reverse Linked List II		092. Reverse Linked List II
094. Binary Tree Inorder Traversal		094. Binary Tree Inorder Traversal
098. Validate Binary Search Tree		098. Validate Binary Search Tree
100. Same Tree		100. Same Tree
101. Symmetric Tree		101. Symmetric Tree
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
105. Construct Binary Tree from Preorder and Inorder Traversal		105. Construct Binary Tree from Preorder and Inorder Traversal
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
107. Binary Tree Level Order Traversal II		107. Binary Tree Level Order Traversal II
108. Convert Sorted Array to Binary Search Tree		108. Convert Sorted Array to Binary Search Tree
109. Convert Sorted List to Binary Search Tree		109. Convert Sorted List to Binary Search Tree
110. Balanced Binary Tree		110. Balanced Binary Tree
111. Minimum Depth of Binary Tree		111. Minimum Depth of Binary Tree
112. Path Sum		112. Path Sum
113. Path Sum II		113. Path Sum II
114. Flatten Binary Tree to Linked List		114. Flatten Binary Tree to Linked List
116. Populating Next Right Pointers in Each Node		116. Populating Next Right Pointers in Each Node
117. Populating Next Right Pointers in Each Node II		117. Populating Next Right Pointers in Each Node II
118. Pascal's Triangle		118. Pascal's Triangle
119. Pascal's Triangle II		119. Pascal's Triangle II
120. Triangle		120. Triangle
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
125. Valid Palindrome		125. Valid Palindrome
128. Longest Consecutive Sequence		128. Longest Consecutive Sequence
129. Sum Root to Leaf Numbers		129. Sum Root to Leaf Numbers
134. Gas Station		134. Gas Station
136. Single Number		136. Single Number
137. Single Number II		137. Single Number II
141. Linked List Cycle		141. Linked List Cycle
142. Linked List Cycle II		142. Linked List Cycle II
143. Reorder List		143. Reorder List
144. Binary Tree Preorder Traversal		144. Binary Tree Preorder Traversal
145. Binary Tree Postorder Traversal		145. Binary Tree Postorder Traversal
148. Sort List		148. Sort List
151. Reverse Words in a String		151. Reverse Words in a String
153. Find Minimum in Rotated Sorted Array		153. Find Minimum in Rotated Sorted Array
154. Find Minimum in Rotated Sorted Array II		154. Find Minimum in Rotated Sorted Array II

AristoChen/LeetCode-AC-Solution

Folders and files

Latest commit

History