Skip to content

awangdev/leet-code

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
Java
Java
 
 
GenerateCodeTable.class
GenerateCodeTable.class
 
 
GenerateCodeTable.java
GenerateCodeTable.java
 
 
README.md
README.md
 
 

Repository files navigation

LintCode

To host Java Solutions to problems from LintCode(http://LintCode.com). I Will try to revise the solutions once new problem or new testing case occurs.

Squence Problem Level Language
0 [2 Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/2 Sum.java) Java
1 [3 Sum Closest.java](https://github.com/shawnfan/LintCode/blob/master/Java/3 Sum Closest.java) Java
2 [3 Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/3 Sum.java) Java
3 [4 Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/4 Sum.java) Java
4 A+B.java Java
5 [Add Binary.java](https://github.com/shawnfan/LintCode/blob/master/Java/Add Binary.java) Java
6 Anagrams.java Java
7 Backpack.java Java
8 [Balanced Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Balanced Binary Tree.java) Java
9 [Best Time to Buy and Sell Stock I.java](https://github.com/shawnfan/LintCode/blob/master/Java/Best Time to Buy and Sell Stock I.java) Java
10 [Best Time to Buy and Sell Stock II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Best Time to Buy and Sell Stock II.java) Java
11 [Best Time to Buy and Sell Stock III .java](https://github.com/shawnfan/LintCode/blob/master/Java/Best Time to Buy and Sell Stock III .java) Java
12 [Binary Representation.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Representation.java) Java
13 [Binary Search.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Search.java) Java
14 [Binary Tree Level Order Traversal II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Level Order Traversal II.java) Java
15 [Binary Tree Level Order Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Level Order Traversal.java) Java
16 [Binary Tree Maximum Path Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Maximum Path Sum.java) Java
17 [Binary Tree Preorder Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Preorder Traversal.java) Java
18 [Binary Tree Zigzag Level Order Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Zigzag Level Order Traversal.java) Java
19 BinaryTreeInorderTraversal.java Java
20 BinaryTreePostorderTraversal.java Java
21 [Climbing Stairs.java](https://github.com/shawnfan/LintCode/blob/master/Java/Climbing Stairs.java) Java
22 [Clone Graph.java](https://github.com/shawnfan/LintCode/blob/master/Java/Clone Graph.java) Java
23 [Combination Sum II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Combination Sum II.java) Java
24 [Combination Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Combination Sum.java) Java
25 Combinations.java Java
26 [Compare Strings.java](https://github.com/shawnfan/LintCode/blob/master/Java/Compare Strings.java) Java
27 [Construct Binary Tree from Inorder and Postorder Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Construct Binary Tree from Inorder and Postorder Traversal.java) Java
28 [Construct Binary Tree from Inorder and Preorder Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Construct Binary Tree from Inorder and Preorder Traversal.java) Java
29 [Convert Integer A to Integer B.java](https://github.com/shawnfan/LintCode/blob/master/Java/Convert Integer A to Integer B.java) Java
30 [Convert Sorted Array to Binary Search Tree With Minimal Height.java](https://github.com/shawnfan/LintCode/blob/master/Java/Convert Sorted Array to Binary Search Tree With Minimal Height.java) Java
31 [Convert Sorted List to Binary Search Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Convert Sorted List to Binary Search Tree.java) Java
32 [Copy List with Random Pointer.java](https://github.com/shawnfan/LintCode/blob/master/Java/Copy List with Random Pointer.java) Java
33 [Count 1 in Binary.java](https://github.com/shawnfan/LintCode/blob/master/Java/Count 1 in Binary.java) Java
34 [Count and Say.java](https://github.com/shawnfan/LintCode/blob/master/Java/Count and Say.java) Java
35 [Delete Digits.java](https://github.com/shawnfan/LintCode/blob/master/Java/Delete Digits.java) Java
36 [Delete Node in the Middle of Singly Linked List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Delete Node in the Middle of Singly Linked List.java) Java
37 [Distinct Subsequences.java](https://github.com/shawnfan/LintCode/blob/master/Java/Distinct Subsequences.java) Java
38 [Easy Reverse Linked List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Easy Reverse Linked List.java) Java
39 [Edit Distance.java](https://github.com/shawnfan/LintCode/blob/master/Java/Edit Distance.java) Java
40 [Fast Power.java](https://github.com/shawnfan/LintCode/blob/master/Java/Fast Power.java) Java
41 Fibonacci.java Java
42 [Find a Peak.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find a Peak.java) Java
43 [Find Minimum in Rotated Sorted Array II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find Minimum in Rotated Sorted Array II.java) Java
44 [Find Minimum in Rotated Sorted Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find Minimum in Rotated Sorted Array.java) Java
45 [Find the Connected Component in the Undirected Graph.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find the Connected Component in the Undirected Graph.java) Java
46 [First Bad Version.java](https://github.com/shawnfan/LintCode/blob/master/Java/First Bad Version.java) Java
47 [First Missing Positive.java](https://github.com/shawnfan/LintCode/blob/master/Java/First Missing Positive.java) Java
48 [Gas Station.java](https://github.com/shawnfan/LintCode/blob/master/Java/Gas Station.java) Java
49 [Hash Function.java](https://github.com/shawnfan/LintCode/blob/master/Java/Hash Function.java) Java
50 [Implement Queue by Two Stacks.java](https://github.com/shawnfan/LintCode/blob/master/Java/Implement Queue by Two Stacks.java) Java
51 [Insert Interval.java](https://github.com/shawnfan/LintCode/blob/master/Java/Insert Interval.java) Java
52 [Insert Node in a Binary Search Tree .java](https://github.com/shawnfan/LintCode/blob/master/Java/Insert Node in a Binary Search Tree .java) Java
53 [Insertion Sort List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Insertion Sort List.java) Java
54 [Interleaving String.java](https://github.com/shawnfan/LintCode/blob/master/Java/Interleaving String.java) Java
55 [Invert Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Invert Binary Tree.java) Java
56 [Jump Game II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Jump Game II.java) Java
57 [Jump Game.java](https://github.com/shawnfan/LintCode/blob/master/Java/Jump Game.java) Java
58 [Kth Largest Element.java](https://github.com/shawnfan/LintCode/blob/master/Java/Kth Largest Element.java) Java
59 [Largest Number.java](https://github.com/shawnfan/LintCode/blob/master/Java/Largest Number.java) Java
60 [Largest Rectangle in Histogram.java](https://github.com/shawnfan/LintCode/blob/master/Java/Largest Rectangle in Histogram.java) Java
61 [Length of Last Word.java](https://github.com/shawnfan/LintCode/blob/master/Java/Length of Last Word.java) Java
62 [Linked List Cycle.java](https://github.com/shawnfan/LintCode/blob/master/Java/Linked List Cycle.java) Java
63 [Longest Common Prefix.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Common Prefix.java) Java
64 [Longest Common Subsequence.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Common Subsequence.java) Java
65 [Longest Common Substring.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Common Substring.java) Java
66 [Longest Consecutive Sequence.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Consecutive Sequence.java) Java
67 [Longest Increasing Continuous subsequence.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Increasing Continuous subsequence.java) Java
68 [Longest Words.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Words.java) Java
69 [Lowest Common Ancestor.java](https://github.com/shawnfan/LintCode/blob/master/Java/Lowest Common Ancestor.java) Java
70 [Majority Number II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Majority Number II.java) Java
71 [Majority Number III.java](https://github.com/shawnfan/LintCode/blob/master/Java/Majority Number III.java) Java
72 [Majority Number.java](https://github.com/shawnfan/LintCode/blob/master/Java/Majority Number.java) Java
73 [Maximum Depth of Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Maximum Depth of Binary Tree.java) Java
74 [Maximum Product Subarray.java](https://github.com/shawnfan/LintCode/blob/master/Java/Maximum Product Subarray.java) Java
75 MaximumSubarray.java Java
76 MaximumSubarrayII.java Java
77 Median.java Java
78 [Merge Intervals.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Intervals.java) Java
79 [Merge k Sorted Lists.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge k Sorted Lists.java) Java
80 [Merge Sorted Array .java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Sorted Array .java) Java
81 [Merge Sorted Array II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Sorted Array II.java) Java
82 [Merge Two Sorted List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Two Sorted List.java) Java
83 [Min Stack.java](https://github.com/shawnfan/LintCode/blob/master/Java/Min Stack.java) Java
84 [Minimum Path Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Minimum Path Sum.java) Java
85 [Minimum Subarray.java](https://github.com/shawnfan/LintCode/blob/master/Java/Minimum Subarray.java) Java
86 [Minimum Window Substring.java](https://github.com/shawnfan/LintCode/blob/master/Java/Minimum Window Substring.java) Java
87 MinimumDepthOfBinaryTree.java Java
88 [Next Permutation.java](https://github.com/shawnfan/LintCode/blob/master/Java/Next Permutation.java) Java
89 NQueens.java Java
90 NQueensII.java Java
91 [Nth to Last Node in List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Nth to Last Node in List.java) Java
92 [Number of Islands.java](https://github.com/shawnfan/LintCode/blob/master/Java/Number of Islands.java) Java
93 [Number Triangles.java](https://github.com/shawnfan/LintCode/blob/master/Java/Number Triangles.java) Java
94 [O(1) Check Power of 2.java](https://github.com/shawnfan/LintCode/blob/master/Java/O(1) Check Power of 2.java) Java
95 [Palindrome Partitioning II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Palindrome Partitioning II.java) Java
96 [Palindrome Partitioning.java](https://github.com/shawnfan/LintCode/blob/master/Java/Palindrome Partitioning.java) Java
97 [Partition Array by Odd and Even.java](https://github.com/shawnfan/LintCode/blob/master/Java/Partition Array by Odd and Even.java) Java
98 [Partition Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Partition Array.java) Java
99 [Partition List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Partition List.java) Java
100 Permutations.java Java
101 [Plus One.java](https://github.com/shawnfan/LintCode/blob/master/Java/Plus One.java) Java
102 [Product of Array Exclude Itself.java](https://github.com/shawnfan/LintCode/blob/master/Java/Product of Array Exclude Itself.java) Java
103 [Recover rotated array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Recover rotated array.java) Java
104 Rehashing.java Java
105 [Remove Duplicates from Sorted Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Duplicates from Sorted Array.java) Java
106 [Remove Duplicates from Sorted List II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Duplicates from Sorted List II.java) Java
107 [Remove Duplicates from Sorted List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Duplicates from Sorted List.java) Java
108 [Remove Node in Binary Search Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Node in Binary Search Tree.java) Java
109 [Remove Nth Node From End of List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Nth Node From End of List.java) Java
110 [Reorder List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Reorder List.java) Java
111 [Reverse Integer.java](https://github.com/shawnfan/LintCode/blob/master/Java/Reverse Integer.java) Java
112 [Reverse Linked List II .java](https://github.com/shawnfan/LintCode/blob/master/Java/Reverse Linked List II .java) Java
113 [Reverse Words in a String.java](https://github.com/shawnfan/LintCode/blob/master/Java/Reverse Words in a String.java) Java
114 [Rotate List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Rotate List.java) Java
115 [Rotate String.java](https://github.com/shawnfan/LintCode/blob/master/Java/Rotate String.java) Java
116 [Search a 2D Matrix II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search a 2D Matrix II.java) Java
117 [Search a 2D Matrix.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search a 2D Matrix.java) Java
118 [Search for a Range.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search for a Range.java) Java
119 [Search Insert Position.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Insert Position.java) Java
120 [Search Range in Binary Search Tree .java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Range in Binary Search Tree .java) Java
121 [Search Rotated Sorted Array II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Rotated Sorted Array II.java) Java
122 [Search Rotated Sorted Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Rotated Sorted Array.java) Java
123 [Serilization and Deserialization Of Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Serilization and Deserialization Of Binary Tree.java) Java
124 [Single Number II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Single Number II.java) Java
125 [Single Number III.java](https://github.com/shawnfan/LintCode/blob/master/Java/Single Number III.java) Java
126 [Single Number.java](https://github.com/shawnfan/LintCode/blob/master/Java/Single Number.java) Java
127 Singleton.java Java
128 [Sort Color.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort Color.java) Java
129 [Sort Colors II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort Colors II.java) Java
130 [Sort Letters by Case.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort Letters by Case.java) Java
131 [Sort List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort List.java) Java
132 [Space Replacement.java](https://github.com/shawnfan/LintCode/blob/master/Java/Space Replacement.java) Java
133 Sqrt(x).java Java
134 [String to Integer(atoi).java](https://github.com/shawnfan/LintCode/blob/master/Java/String to Integer(atoi).java) Java
135 StrStr.java Java
136 [Subarray Sum Closest.java](https://github.com/shawnfan/LintCode/blob/master/Java/Subarray Sum Closest.java) Java
137 [Subarray Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Subarray Sum.java) Java
138 Subset.java Java
139 Subtree.java Java
140 [Topological Sorting.java](https://github.com/shawnfan/LintCode/blob/master/Java/Topological Sorting.java) Java
141 [Trailing Zeros.java](https://github.com/shawnfan/LintCode/blob/master/Java/Trailing Zeros.java) Java
142 [Two Lists Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Two Lists Sum.java) Java
143 [Two Strings Are Anagrams.java](https://github.com/shawnfan/LintCode/blob/master/Java/Two Strings Are Anagrams.java) Java
144 [Ugly Number.java](https://github.com/shawnfan/LintCode/blob/master/Java/Ugly Number.java) Java
145 [Unique Binary Search Tree II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Binary Search Tree II.java) Java
146 [Unique Binary Search Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Binary Search Tree.java) Java
147 [Unique Path.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Path.java) Java
148 [Unique Paths II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Paths II.java) Java
149 [Unique Permutations.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Permutations.java) Java
150 [Unique Subset.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Subset.java) Java
151 [Update Bits.java](https://github.com/shawnfan/LintCode/blob/master/Java/Update Bits.java) Java
152 [Validate Binary Search Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Validate Binary Search Tree.java) Java
153 [Wood Cut.java](https://github.com/shawnfan/LintCode/blob/master/Java/Wood Cut.java) Java
154 [Word Break.java](https://github.com/shawnfan/LintCode/blob/master/Java/Word Break.java) Java
155 [Word Ladder II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Word Ladder II.java) Java
156 [Word Ladder.java](https://github.com/shawnfan/LintCode/blob/master/Java/Word Ladder.java) Java

About

Java Solutions to problems on LintCode/LeetCode

Topics

java algorithm leetcode lintcode java-solution dynamicprogramming

Resources

Readme
Activity

Stars

4.4k stars

Watchers

383 watching

Forks

28 forks
Report repository

Releases

No releases published

Sponsor this project

 
Learn more about GitHub Sponsors

Packages

 
 
 

Contributors 2

Languages