GitHub - codingwhite/leetcode: My leetcode Solutions.java · GitHub

Name		Name	Last commit message	Last commit date
3sum-closest		3sum-closest
3sum		3sum
4sum		4sum
_includes		_includes
_layouts		_layouts
add-binary		add-binary
add-two-numbers		add-two-numbers
anagrams		anagrams
balanced-binary-tree		balanced-binary-tree
best-time-to-buy-and-sell-stock-ii		best-time-to-buy-and-sell-stock-ii
best-time-to-buy-and-sell-stock-iii		best-time-to-buy-and-sell-stock-iii
best-time-to-buy-and-sell-stock		best-time-to-buy-and-sell-stock
binary-tree-inorder-traversal		binary-tree-inorder-traversal
binary-tree-level-order-traversal-ii		binary-tree-level-order-traversal-ii
binary-tree-level-order-traversal		binary-tree-level-order-traversal
binary-tree-maximum-path-sum		binary-tree-maximum-path-sum
binary-tree-postorder-traversal		binary-tree-postorder-traversal
binary-tree-preorder-traversal		binary-tree-preorder-traversal
binary-tree-zigzag-level-order-traversal		binary-tree-zigzag-level-order-traversal
candy		candy
climbing-stairs		climbing-stairs
clone-graph		clone-graph
combination-sum-ii		combination-sum-ii
combination-sum		combination-sum
combinations		combinations
construct-binary-tree-from-inorder-and-postorder-traversal		construct-binary-tree-from-inorder-and-postorder-traversal
construct-binary-tree-from-preorder-and-inorder-traversal		construct-binary-tree-from-preorder-and-inorder-traversal
container-with-most-water		container-with-most-water
convert-sorted-array-to-binary-search-tree		convert-sorted-array-to-binary-search-tree
convert-sorted-list-to-binary-search-tree		convert-sorted-list-to-binary-search-tree
copy-list-with-random-pointer		copy-list-with-random-pointer
count-and-say		count-and-say
css		css
decode-ways		decode-ways
distinct-subsequences		distinct-subsequences
divide-two-integers		divide-two-integers
edit-distance		edit-distance
evaluate-reverse-polish-notation		evaluate-reverse-polish-notation
first-missing-positive		first-missing-positive
flatten-binary-tree-to-linked-list		flatten-binary-tree-to-linked-list
gas-station		gas-station
generate-parentheses		generate-parentheses
gray-code		gray-code
implement-strstr		implement-strstr
insert-interval		insert-interval
insertion-sort-list		insertion-sort-list
integer-to-roman		integer-to-roman
interleaving-string		interleaving-string
jump-game-ii		jump-game-ii
jump-game		jump-game
largest-rectangle-in-histogram		largest-rectangle-in-histogram
length-of-last-word		length-of-last-word
letter-combinations-of-a-phone-number		letter-combinations-of-a-phone-number
linked-list-cycle-ii		linked-list-cycle-ii
linked-list-cycle		linked-list-cycle
longest-common-prefix		longest-common-prefix
longest-consecutive-sequence		longest-consecutive-sequence
longest-palindromic-substring		longest-palindromic-substring
longest-substring-without-repeating-characters		longest-substring-without-repeating-characters
longest-valid-parentheses		longest-valid-parentheses
lru-cache		lru-cache
max-points-on-a-line		max-points-on-a-line
maximal-rectangle		maximal-rectangle
maximum-depth-of-binary-tree		maximum-depth-of-binary-tree
maximum-subarray		maximum-subarray
median-of-two-sorted-arrays		median-of-two-sorted-arrays
merge-intervals		merge-intervals
merge-k-sorted-lists		merge-k-sorted-lists
merge-sorted-array		merge-sorted-array
merge-two-sorted-lists		merge-two-sorted-lists
minimum-depth-of-binary-tree		minimum-depth-of-binary-tree
minimum-path-sum		minimum-path-sum
minimum-window-substring		minimum-window-substring
multiply-strings		multiply-strings
n-queens-ii		n-queens-ii
n-queens		n-queens
next-permutation		next-permutation
palindrome-number		palindrome-number
palindrome-partitioning-ii		palindrome-partitioning-ii
palindrome-partitioning		palindrome-partitioning
partition-list		partition-list
pascals-triangle-ii		pascals-triangle-ii
pascals-triangle		pascals-triangle
path-sum-ii		path-sum-ii
path-sum		path-sum
permutation-sequence		permutation-sequence
permutations-ii		permutations-ii
permutations		permutations
plus-one		plus-one
populating-next-right-pointers-in-each-node-ii		populating-next-right-pointers-in-each-node-ii
populating-next-right-pointers-in-each-node		populating-next-right-pointers-in-each-node
powx-n		powx-n
recover-binary-search-tree		recover-binary-search-tree
regular-expression-matching		regular-expression-matching
remove-duplicates-from-sorted-array-ii		remove-duplicates-from-sorted-array-ii
remove-duplicates-from-sorted-array		remove-duplicates-from-sorted-array
remove-duplicates-from-sorted-list-ii		remove-duplicates-from-sorted-list-ii
remove-duplicates-from-sorted-list		remove-duplicates-from-sorted-list
remove-element		remove-element
remove-nth-node-from-end-of-list		remove-nth-node-from-end-of-list

Repository files navigation

#Leetcode solutions

Please Donate leetcode

Milestone

151 AC Jul 20 2014
151 Detailed solving thought Aug 31 2014

TODO

Evaluate the Time and Space complexity of each solution
Proof the code's correctness if needed
Find better solutions

About

My leetcode Solutions.java

leetcode.tgic.me/

1 star

1 watching

Report repository

Releases

Packages

Contributors