LeetCode 解法 (Go, Java, JavaScript, Kotlin, Python, Swift)

My Solutions for LeetCode problems written in Go, Java, JavaScript, Kotlin, Python and Swift.

Progress: 92 / 768

Solutions

#	Title	Go	Java	JavaScript	Kotlin	Python	Swift	Difficulty
1	Two Sum	√	√	√	√	√	√	Easy
2	Add Two Numbers	√	√	√	√	√	√	Medium
3	Longest Substring Without Repeating Characters	√	√	√	√	√	√	Medium
5	Longest Palindromic Substring	√	√	√	√	√	√	Medium
6	ZigZag Conversion	√	√	√	√	√	√	Medium
7	Reverse Integer	√	√	√	√	√	√	Easy
8	String to Integer (atoi)	√	√	√	√	√	√	Medium
9	Palindrome Number	√	√	√	√	√	√	Medium
11	Container With Most Water	√	√	√	√	√	√	Medium
12	Integer to Roman	√	√	√	√	√	√	Medium
13	Roman to Integer	√	√	√	√	√	√	Easy
14	Longest Common Prefix	√	√	√	√	√	√	Easy
15	3Sum	√	√	√	√	√	√	Medium
16	3Sum Closest	√	√	√	√	√	√	Medium
17	Letter Combinations of a Phone Number	√	√	√	√	√	√	Medium
18	4Sum	√	√	√	√	√	√	Medium
19	Remove Nth Node From End of List	√	√	√	√	√	√	Medium
20	Valid Parentheses	√	√	√	√	√	√	Easy
21	Merge Two Sorted Lists	√	√	√	√	√	√	Easy
22	Generate Parentheses	√	√	√	√	√	√	Medium
24	Swap Nodes in Pairs	√	√	√	√	√	√	Medium
26	Remove Duplicates from Sorted Array	√	√	√	√	√	√	Easy
27	Remove Element	√	√	√	√	√	√	Easy
28	Implement strStr()	√	√	√	√	√	√	Easy
29	Divide Two Integers	√	√	√	√	√	√	Medium
31	Next Permutation	√	√	√	√	√	√	Medium
33	Search in Rotated Sorted Array	√	√	√	√	√	√	Medium
34	Search for a Range	√	√	√	√	√	√	Medium
35	Search Insert Position	√	√	√	√	√	√	Easy
36	Valid Sudoku	√	√	√	√	√	√	Medium
38	Count and Say	√	√	√	√	√	√	Easy
39	Combination Sum	√	√	√	√	√	√	Medium
40	Combination Sum II	√	√	√	√	√	√	Medium
43	Multiply Strings	√	√	√	√	√	√	Medium
46	Permutations	√	√	√	√	√	√	Medium
47	PermutationsII	√	√	√	√	√	√	Medium
48	Rotate Image	√	√	√	√	√	√	Medium
49	Group Anagrams	√	√	√	√	√	√	Medium
50	Pow(x, n)	√	√	√	√	√	√	Medium
53	Maximum Subarray	√	√	√	√	√	√	Easy
54	Spiral Matrix	√	√	√	√	√	√	Medium
55	Jump Game	√	√	√	√	√	√	Medium
56	Merge Intervals	√	√	√	√	√	√	Medium
58	Length of Last Word	√	√	√	√	√	√	Easy
59	Spiral Matrix II	√	√	√	√	√	√	Medium
61	Rotate List	√	√	√	√	√	√	Medium
62	Unique Paths	√	√	√	√	√	√	Medium
63	Unique Paths II	√	√	√	√	√	√	Medium
64	Minimum Path Sum	√	√	√	√	√	√	Medium
66	Plus One	√	√	√	√	√	√	Easy
67	Add Binary	√	√	√	√	√	√	Easy
69	Sqrt(x)	√	√	√	√	√	√	Easy
70	Climbing Stairs	√	√	√	√	√	√	Easy
71	Simplify Path	√	√	√	√	√	√	Medium
73	Set Matrix Zeroes	√	√	√	√	√	√	Medium
74	Search a 2D Matrix	√	√	√	√	√	√	Medium
75	Sort Colors	√	√	√	√	√	√	Medium
77	Combinations	√	√	√	√	√	√	Medium
78	Subsets	√	√	√	√	√	√	Medium
79	Word Search	√	√	√	√	√	√	Medium
80	Remove Duplicates from Sorted Array II	√	√	√	√	√	√	Medium
81	Search in Rotated Sorted Array II	√	√	√	√	√	√	Medium
82	Remove Duplicates from Sorted List II	√	√	√	√	√	√	Medium
83	Remove Duplicates from Sorted List	√	√	√	√	√	√	Easy
86	Partition List	√	√	√	√	√	√	Medium
88	Merge Sorted Array	√	√	√	√	√	√	Easy
89	Gray Code	√	√	√	√	√	√	Medium
90	SubsetsII	√	√	√	√	√	√	Medium
91	Decode Ways	√	√	√	√	√	√	Medium
92	Reverse Linked List II	√	√	√	√	√	√	Medium
93	Restore IP Addresses	√	√	√	√	√	√	Medium
94	Binary Tree Inorder Traversal	√	√	√	√	√	√	Medium
95	Unique Binary Search Trees II	√	√	√	√	√	√	Medium
96	Unique Binary Search Trees	√	√	√	√	√	√	Medium
98	Validate Binary Search Tree	√	√	√	√	√	√	Medium
100	Same Tree	√	√	√	√	√	√	Easy
101	Symmetric Tree	√	√	√	√	√	√	Easy
102	Binary Tree Level Order Traversal	√	√	√	√	√	√	Medium
104	Maximum Depth of Binary Tree	√	√	√	√	√	√	Easy
107	Binary Tree Level Order Traversal II	√	√	√	√	√	√	Easy
112	Path Sum	√	√	√	√	√	√	Easy
118	Pascal's Triangle	√	√	√	√	√	√	Easy
119	Pascal's Triangle II	√	√	√	√	√	√	Easy
136	Single Number	√	√	√	√	√	√	Easy
137	Single Number II	√	√	√	√	√	√	Medium
141	Linked List Cycle	?	√	√	?	√	?	Easy
142	Linked List Cycle II	?	√	√	?	√	?	Medium
147	Insertion Sort List	√	√	√	√	√	√	Medium
148	Sort List	√	√	√	√	√	√	Medium
160	Intersection of Two Linked Lists	?	√	√	?	√	?	Easy
168	Excel Sheet Column Title	√	√	√	√	√	√	Easy
169	Majority Element	√	√	√	√	√	√	Easy

Contributions

⚠️ Notice: We do NOT accept pull requests currently.

License

Windary is under an MIT license. See the LICENSE for more information.