Skip to content

kingname/LeetCode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
.gitignore
.gitignore
 
 
370986912.flag
370986912.flag
 
 
README.md
README.md
 
 
add-binary.py
add-binary.py
 
 
add-digits.py
add-digits.py
 
 
add-two-numbers.py
add-two-numbers.py
 
 
balanced-binary-tree.py
balanced-binary-tree.py
 
 
best-time-to-buy-and-sell-stock.py
best-time-to-buy-and-sell-stock.py
 
 
binary-search-tree-iterator.py
binary-search-tree-iterator.py
 
 
binary-tree-inorder-traversal.py
binary-tree-inorder-traversal.py
 
 
binary-tree-level-order-traversal-ii.py
binary-tree-level-order-traversal-ii.py
 
 
binary-tree-level-order-traversal.py
binary-tree-level-order-traversal.py
 
 
binary-tree-paths.py
binary-tree-paths.py
 
 
binary-tree-zigzag-level-order-traversal.py
binary-tree-zigzag-level-order-traversal.py
 
 
bulls-and-cows.py
bulls-and-cows.py
 
 
climbing-stairs.py
climbing-stairs.py
 
 
construct-binary-tree-from-inorder-and-postorder-traversal.py
construct-binary-tree-from-inorder-and-postorder-traversal.py
 
 
construct-binary-tree-from-preorder-and-inorder-traversal.py
construct-binary-tree-from-preorder-and-inorder-traversal.py
 
 
contains-duplicate-ii.py
contains-duplicate-ii.py
 
 
contains-duplicate.py
contains-duplicate.py
 
 
convert-sorted-array-to-binary-search-tree.py
convert-sorted-array-to-binary-search-tree.py
 
 
convert-sorted-list-to-binary-search-tree.py
convert-sorted-list-to-binary-search-tree.py
 
 
copy-list-with-random-pointer.py
copy-list-with-random-pointer.py
 
 
copy-list-with-random-pointer_1.py
copy-list-with-random-pointer_1.py
 
 
count-and-say.py
count-and-say.py
 
 
count-primes.py
count-primes.py
 
 
delete-node-in-a-linked-list.py
delete-node-in-a-linked-list.py
 
 
downloader.py
downloader.py
 
 
find-peak-element.py
find-peak-element.py
 
 
first-bad-version.py
first-bad-version.py
 
 
generate-parentheses.py
generate-parentheses.py
 
 
happy-number.py
happy-number.py
 
 
implement-queue-using-stacks.py
implement-queue-using-stacks.py
 
 
implement-stack-using-queues.py
implement-stack-using-queues.py
 
 
implement-strstr.py
implement-strstr.py
 
 
intersection-of-two-arrays-ii.py
intersection-of-two-arrays-ii.py
 
 
intersection-of-two-arrays.py
intersection-of-two-arrays.py
 
 
invert-binary-tree.py
invert-binary-tree.py
 
 
isomorphic-strings.py
isomorphic-strings.py
 
 
isomorphic-strings_1.py
isomorphic-strings_1.py
 
 
jewels-and-stones.py
jewels-and-stones.py
 
 
length-of-last-word.py
length-of-last-word.py
 
 
linked-list-cycle.py
linked-list-cycle.py
 
 
longest-common-prefix.py
longest-common-prefix.py
 
 
lowest-common-ancestor-of-a-binary-search-tree.py
lowest-common-ancestor-of-a-binary-search-tree.py
 
 
majority-element.py
majority-element.py
 
 
maximum-depth-of-binary-tree.py
maximum-depth-of-binary-tree.py
 
 
maximum-subarray.py
maximum-subarray.py
 
 
merge-sorted-array.py
merge-sorted-array.py
 
 
merge-two-sorted-lists.py
merge-two-sorted-lists.py
 
 
min-stack.py
min-stack.py
 
 
missing-number.py
missing-number.py
 
 
missing-number_1.py
missing-number_1.py
 
 
missing-number_2.py
missing-number_2.py
 
 
move-zeroes.py
move-zeroes.py
 
 
nim-game.py
nim-game.py
 
 
number-of-1-bits.py
number-of-1-bits.py
 
 
palindrome-number.py
palindrome-number.py
 
 
pascals-triangle.py
pascals-triangle.py
 
 
path-sum-ii.py
path-sum-ii.py
 
 
path-sum.py
path-sum.py
 
 
plus-one.py
plus-one.py
 
 
power-of-four.py
power-of-four.py
 
 
power-of-three.py
power-of-three.py
 
 
power-of-two.py
power-of-two.py
 
 
power-of-two_1.py
power-of-two_1.py
 
 
range-sum-query-immutable.py
range-sum-query-immutable.py
 
 
remove-duplicates-from-sorted-array.py
remove-duplicates-from-sorted-array.py
 
 
remove-duplicates-from-sorted-list.py
remove-duplicates-from-sorted-list.py
 
 
remove-element.py
remove-element.py
 
 
remove-linked-list-elements.py
remove-linked-list-elements.py
 
 
reorder-list.py
reorder-list.py
 
 
repeated-dna-sequences.py
repeated-dna-sequences.py
 
 
restore-ip-addresses.py
restore-ip-addresses.py
 
 
reverse-bits.py
reverse-bits.py
 
 
reverse-integer.py
reverse-integer.py
 
 
reverse-linked-list-ii.py
reverse-linked-list-ii.py
 
 
reverse-linked-list.py
reverse-linked-list.py
 
 
reverse-string.py
reverse-string.py
 
 
reverse-string_1.py
reverse-string_1.py
 
 
reverse-vowels-of-a-string.py
reverse-vowels-of-a-string.py
 
 
reverse-words-in-a-string.py
reverse-words-in-a-string.py
 
 
rotate-array.py
rotate-array.py
 
 
same-tree.py
same-tree.py
 
 
search-insert-position.py
search-insert-position.py
 
 
single-number-ii.py
single-number-ii.py
 
 
sort-list.py
sort-list.py
 
 
sqrtx.py
sqrtx.py
 
 
sum-of-two-integers.py
sum-of-two-integers.py
 
 
sum-root-to-leaf-numbers.py
sum-root-to-leaf-numbers.py
 
 
symmetric-tree.py
symmetric-tree.py
 
 
symmetric-tree_1.py
symmetric-tree_1.py
 
 
two-sum-ii-input-array-is-sorted.py
two-sum-ii-input-array-is-sorted.py
 
 
two-sum.py
two-sum.py
 
 
ugly-number.py
ugly-number.py
 
 
unique-binary-search-trees.py
unique-binary-search-trees.py
 
 
unique-binary-search-trees_1.py
unique-binary-search-trees_1.py
 
 
valid-parentheses.py
valid-parentheses.py
 
 
valid-parentheses_1.py
valid-parentheses_1.py
 
 
valid-perfect-square.py
valid-perfect-square.py
 
 

Repository files navigation

LeetCode

My Code for problems in LeetCode.

This is the first try for me to solve these problem, so the code may be stupid and long.

You can download your submissions by change and run downloader.py. This script will login to your LeetCode account and download all accepted submission. For the same problem which submitted for times, the file will be named xxx.py, xxx_1.py, xxx_2.py and etc.

About

My Code for problems in LeetCode.

Resources

Readme
Activity

Stars

18 stars

Watchers

3 watching

Forks

3 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages