leetcode-python

My python and C++ solution and thinking for leetcode algorithm questions After I suffered from Python perfomance limit, I switched to C++.
(Especially when dealing with lists, many wired TLE cases).

Also the lessons for python:

The shallow copy and deep copy.
The reference and objects.
Inner function of method and other memeber functions.

Name		Name	Last commit message	Last commit date
Latest commit History 298 Commits
playTry		playTry
.gitignore		.gitignore
3SumClosest.py		3SumClosest.py
412FizzBuzz.cpp		412FizzBuzz.cpp
4sum_cubic.py		4sum_cubic.py
4sum_hash.py		4sum_hash.py
H_index_II.cpp		H_index_II.cpp
LRU_cache.cpp		LRU_cache.cpp
README.md		README.md
add_binary.py		add_binary.py
addictive_numbers.cpp		addictive_numbers.cpp
balanced_binary_tree.py		balanced_binary_tree.py
best_time_to_buyAndSell_staock_IV.py		best_time_to_buyAndSell_staock_IV.py
best_time_to_buyAndSell_stock.py		best_time_to_buyAndSell_stock.py
best_time_to_buyAndSell_stock_II.py		best_time_to_buyAndSell_stock_II.py
best_time_to_buyAndSell_stock_III.py		best_time_to_buyAndSell_stock_III.py
best_time_to_sellAndBuy_stock_with_cooldown.py		best_time_to_sellAndBuy_stock_with_cooldown.py
big_interget_addition_using_string.cpp		big_interget_addition_using_string.cpp
binary_search_tree_iterator.cpp		binary_search_tree_iterator.cpp
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.py		binary_tree_level_order_traversal.py
binary_tree_level_order_traversal_II.py		binary_tree_level_order_traversal_II.py
binary_tree_maximum_path_sum.cpp		binary_tree_maximum_path_sum.cpp
binary_tree_paths.py		binary_tree_paths.py
binary_tree_preorder_traversal.py		binary_tree_preorder_traversal.py
binary_tree_right_side_view.cpp		binary_tree_right_side_view.cpp
binary_tree_zigzag_level_order_traversal.cpp		binary_tree_zigzag_level_order_traversal.cpp
bitwise_and_of_numbers_range.py		bitwise_and_of_numbers_range.py
builb_switcher.py		builb_switcher.py
bulls_and_cows.py		bulls_and_cows.py
burst_ballons.py		burst_ballons.py
circularArrayLoop.cpp		circularArrayLoop.cpp
climing_stairs.py		climing_stairs.py
coin_change.py		coin_change.py
combination_sum.py		combination_sum.py
combination_sum_II.py		combination_sum_II.py
combination_sum_III.py		combination_sum_III.py
combinations.py		combinations.py
compare_version_numbers.py		compare_version_numbers.py
construct_binary_tree_from_inorder_and_postorder_traversal.py		construct_binary_tree_from_inorder_and_postorder_traversal.py
construct_binary_tree_from_inorder_and_preorder_traversal.py		construct_binary_tree_from_inorder_and_preorder_traversal.py
construct_binary_tree_from_preorder_and_postorder_traversal.py		construct_binary_tree_from_preorder_and_postorder_traversal.py
contain_duplicates.py		contain_duplicates.py
container_with_most_water.py		container_with_most_water.py
contains_duplicate_II.py		contains_duplicate_II.py
convert_sorted_array_to_binary_tree.py		convert_sorted_array_to_binary_tree.py
convert_sorted_list_to_binary_search_tree.cpp		convert_sorted_list_to_binary_search_tree.cpp
count_and_say.py		count_and_say.py
count_primes.py		count_primes.py
counting_bits.py		counting_bits.py
delete_node_in_singly_linked_list.py		delete_node_in_singly_linked_list.py
detectCycleHead.py		detectCycleHead.py
different_ways_to_add_parentheses.cpp		different_ways_to_add_parentheses.cpp
duplicated_quick_selection.cpp		duplicated_quick_selection.cpp
evaluate_reverse_polish_notation.py		evaluate_reverse_polish_notation.py
excel_sheet_column_title.py		excel_sheet_column_title.py
faltten_binary_tree_to_linked_list.py		faltten_binary_tree_to_linked_list.py
findKthElementInArray.cpp		findKthElementInArray.cpp
find_minimum_in_rotated_sorted_array.cpp		find_minimum_in_rotated_sorted_array.cpp
find_minimum_in_rotated_sorted_array.py		find_minimum_in_rotated_sorted_array.py
find_peak_element.py		find_peak_element.py
find_the_duplicate_number.py		find_the_duplicate_number.py
first_bad_version.py		first_bad_version.py
game_of_lift.cpp		game_of_lift.cpp
gas_station.cpp		gas_station.cpp
generate_parentheses.py		generate_parentheses.py
get_tree_path.cpp		get_tree_path.cpp
gray_code.py		gray_code.py
h_index.cpp		h_index.cpp
hamming_distance.cpp		hamming_distance.cpp
happy_number.py		happy_number.py
house_rob_III.py		house_rob_III.py
house_robber.py		house_robber.py
house_robber_II.py		house_robber_II.py
implement_queue_using_stack.py		implement_queue_using_stack.py
implement_stack_using_twoQueues.py		implement_stack_using_twoQueues.py
implement_strStr.py		implement_strStr.py
increasing_triplet_subsequence.cpp		increasing_triplet_subsequence.cpp
insertion_sort_list.py		insertion_sort_list.py
integer_break.cpp		integer_break.cpp
intersection_of_two_arrays.cpp		intersection_of_two_arrays.cpp
intersection_of_two_linked_list.py		intersection_of_two_linked_list.py
isomophic_strings.py		isomophic_strings.py
jump_game.cpp		jump_game.cpp
kthSmallest_element_in_BST.py		kthSmallest_element_in_BST.py
kth_largest_element_in_Array.py		kth_largest_element_in_Array.py
length_of_last_word.py		length_of_last_word.py
letter_combinations_of_a_phone_number.cpp		letter_combinations_of_a_phone_number.cpp
linked_list_cycle.py		linked_list_cycle.py
linkedlistCycle.py		linkedlistCycle.py
longest_common_prefix.py		longest_common_prefix.py
longest_increasing_subsequence.py		longest_increasing_subsequence.py
lowest_common_ancestor.cpp		lowest_common_ancestor.cpp
lowest_common_ancestor_of_binarySearchTree.py		lowest_common_ancestor_of_binarySearchTree.py
majority_element.py		majority_element.py
majority_element_II.cpp		majority_element_II.cpp
max_top_down_straight_tree_path.cpp		max_top_down_straight_tree_path.cpp
maximal_square.py		maximal_square.py
maximum_product_of_word_lengths.py		maximum_product_of_word_lengths.py

XBOOS/leetcode-solutions

Folders and files

Latest commit

History