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
Appearance settings

thinking-machine/leetcode-3

BranchesTags
Open more actions menu
 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

171 Commits
171 Commits
.gitignore
.gitignore
 
 
1.two sum.go
1.two sum.go
 
 
1.two sum.py
1.two sum.py
 
 
10. Regular Expression Matching.go
10. Regular Expression Matching.go
 
 
100. Same Tree.go
100. Same Tree.go
 
 
101. Symmetric Tree.go
101. Symmetric Tree.go
 
 
102. Binary Tree Level Order Traversal.go
102. Binary Tree Level Order Traversal.go
 
 
103. Binary Tree Zigzag Level Order Traversal.go
103. Binary Tree Zigzag Level Order Traversal.go
 
 
104. Maximum Depth of Binary Tree.go
104. Maximum Depth of Binary Tree.go
 
 
105. Construct Binary Tree from Preorder and Inorder Traversal.go
105. Construct Binary Tree from Preorder and Inorder Traversal.go
 
 
106. Construct Binary Tree from Inorder and Postorder Traversal.go
106. Construct Binary Tree from Inorder and Postorder Traversal.go
 
 
107. Binary Tree Level Order Traversal II.go
107. Binary Tree Level Order Traversal II.go
 
 
108. Convert Sorted Array to Binary Search Tree.go
108. Convert Sorted Array to Binary Search Tree.go
 
 
109. Convert Sorted List to Binary Search Tree.go
109. Convert Sorted List to Binary Search Tree.go
 
 
11. Container With Most Water.go
11. Container With Most Water.go
 
 
110. Balanced Binary Tree.go
110. Balanced Binary Tree.go
 
 
111. Minimum Depth of Binary Tree.go
111. Minimum Depth of Binary Tree.go
 
 
112. Path Sum.go
112. Path Sum.go
 
 
113. Path Sum II.go
113. Path Sum II.go
 
 
114. Flatten Binary Tree to Linked List.go
114. Flatten Binary Tree to Linked List.go
 
 
115. Distinct Subsequences.go
115. Distinct Subsequences.go
 
 
116. Populating Next Right Pointers in Each Node.cpp
116. Populating Next Right Pointers in Each Node.cpp
 
 
117. Populating Next Right Pointers in Each Node II.cpp
117. Populating Next Right Pointers in Each Node II.cpp
 
 
118. Pascal's Triangle.go
118. Pascal's Triangle.go
 
 
119. Pascal's Triangle II.go
119. Pascal's Triangle II.go
 
 
12. Integer to Roman.go
12. Integer to Roman.go
 
 
120. Triangle.cpp
120. Triangle.cpp
 
 
121. Best Time to Buy and Sell Stock.go
121. Best Time to Buy and Sell Stock.go
 
 
122. Best Time to Buy and Sell Stock II.go
122. Best Time to Buy and Sell Stock II.go
 
 
123. Best Time to Buy and Sell Stock III.go
123. Best Time to Buy and Sell Stock III.go
 
 
124. Binary Tree Maximum Path Sum.go
124. Binary Tree Maximum Path Sum.go
 
 
125. Valid Palindrome.go
125. Valid Palindrome.go
 
 
128. Longest Consecutive Sequence.go
128. Longest Consecutive Sequence.go
 
 
129. Sum Root to Leaf Numbers.go
129. Sum Root to Leaf Numbers.go
 
 
13. Roman to Integer.go
13. Roman to Integer.go
 
 
130. Surrounded Regions.go
130. Surrounded Regions.go
 
 
131. Palindrome Partitioning.cpp
131. Palindrome Partitioning.cpp
 
 
132. Palindrome Partitioning II.go
132. Palindrome Partitioning II.go
 
 
133. Clone Graph.cpp
133. Clone Graph.cpp
 
 
134. Gas Station.go
134. Gas Station.go
 
 
135. Candy.go
135. Candy.go
 
 
136. Single Number.go
136. Single Number.go
 
 
137. Single Number II.go
137. Single Number II.go
 
 
138. Copy List with Random Pointer.cpp
138. Copy List with Random Pointer.cpp
 
 
139. Word Break.cpp
139. Word Break.cpp
 
 
14. Longest Common Prefix.go
14. Longest Common Prefix.go
 
 
140. Word Break II.cpp
140. Word Break II.cpp
 
 
141. Linked List Cycle.cpp
141. Linked List Cycle.cpp
 
 
142. Linked List Cycle II.cpp
142. Linked List Cycle II.cpp
 
 
143. Reorder List.go
143. Reorder List.go
 
 
144. Binary Tree Preorder Traversal.go
144. Binary Tree Preorder Traversal.go
 
 
145. Binary Tree Postorder Traversal.go
145. Binary Tree Postorder Traversal.go
 
 
146. LRU Cache.cpp
146. LRU Cache.cpp
 
 
147. Insertion Sort List.go
147. Insertion Sort List.go
 
 
148. Sort List.go
148. Sort List.go
 
 
149. Max Points on a Line.go
149. Max Points on a Line.go
 
 
15. 3Sum.go
15. 3Sum.go
 
 
150. Evaluate Reverse Polish Notation.go
150. Evaluate Reverse Polish Notation.go
 
 
151. Reverse Words in a String.cpp
151. Reverse Words in a String.cpp
 
 
152. Maximum Product Subarray.go
152. Maximum Product Subarray.go
 
 
153. Find Minimum in Rotated Sorted Array.go
153. Find Minimum in Rotated Sorted Array.go
 
 
155. Min Stack.cpp
155. Min Stack.cpp
 
 
16. 3Sum Closest.go
16. 3Sum Closest.go
 
 
160. Intersection of Two Linked Lists.c
160. Intersection of Two Linked Lists.c
 
 
162. Find Peak Element.go
162. Find Peak Element.go
 
 
164. Maximum Gap.go
164. Maximum Gap.go
 
 
165. Compare Version Numbers.go
165. Compare Version Numbers.go
 
 
166. Fraction to Recurring Decimal.go
166. Fraction to Recurring Decimal.go
 
 
167. Two Sum II - Input array is sorted.go
167. Two Sum II - Input array is sorted.go
 
 
168. Excel Sheet Column Title.go
168. Excel Sheet Column Title.go
 
 
169. Majority Element.go
169. Majority Element.go
 
 
17. Letter Combinations of a Phone Number.go
17. Letter Combinations of a Phone Number.go
 
 
171. Excel Sheet Column Number.go
171. Excel Sheet Column Number.go
 
 
172. Factorial Trailing Zeroes.go
172. Factorial Trailing Zeroes.go
 
 
173. Binary Search Tree Iterator.cpp
173. Binary Search Tree Iterator.cpp
 
 
174. Dungeon Game.go
174. Dungeon Game.go
 
 
179. Largest Number.go
179. Largest Number.go
 
 
18. 4Sum.go
18. 4Sum.go
 
 
187. Repeated DNA Sequences.go
187. Repeated DNA Sequences.go
 
 
188. Best Time to Buy and Sell Stock IV.go
188. Best Time to Buy and Sell Stock IV.go
 
 
189. Rotate Array.go
189. Rotate Array.go
 
 
190. Reverse Bits.c
190. Reverse Bits.c
 
 
191. Number of 1 Bits.c
191. Number of 1 Bits.c
 
 
198. House Robber.go
198. House Robber.go
 
 
199. Binary Tree Right Side View.go
199. Binary Tree Right Side View.go
 
 
2. Add Two Numbers.py
2. Add Two Numbers.py
 
 
2.add two numbers.go
2.add two numbers.go
 
 
200. Number of Islands.go
200. Number of Islands.go
 
 
201. Bitwise AND of Numbers Range.go
201. Bitwise AND of Numbers Range.go
 
 
202. Happy Number.go
202. Happy Number.go
 
 
203. Remove Linked List Elements.go
203. Remove Linked List Elements.go
 
 
204. Count Primes.go
204. Count Primes.go
 
 
205. Isomorphic Strings.go
205. Isomorphic Strings.go
 
 
206. Reverse Linked List.go
206. Reverse Linked List.go
 
 
207. Course Schedule.go
207. Course Schedule.go
 
 
208. Implement Trie (Prefix Tree).cpp
208. Implement Trie (Prefix Tree).cpp
 
 
209. Minimum Size Subarray Sum.go
209. Minimum Size Subarray Sum.go
 
 
21. Merge Two Sorted Lists.go
21. Merge Two Sorted Lists.go
 
 
210. Course Schedule II.go
210. Course Schedule II.go
 
 
211. Add and Search Word - Data structure design.cpp
211. Add and Search Word - Data structure design.cpp
 
 

Repository files navigation

leetcode

This is a answer collection of leetcode written in Golang.

If one question support golang, I will try to use golang to solve it. If not, I'll use cpp.
If there are some problem I can't solve. I'll put some blogs' link in it.

Almost of the answers is a runnable go file. I have added some basic function and type like ListNode && buildList and LinkNode&&buildLink for local test.

The answer list is :

As Github has changed it's grammar in Markdown(maybe), I can't list the QA and the answer link now. So if you want to search one answer, you can use CTRL+F to search the title of the question to get an answer.

About

Leetcode golang solution.

Resources

Readme
Activity
Custom properties

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages

  • Go 97.4%
  • C++ 2.1%
  • Other 0.5%
Morty Proxy This is a proxified and sanitized view of the page, visit original site.