Skip to content

CircleYuanHe/leetcode-2

BranchesTags
 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

65 Commits
01-matrix_1_AC.cpp
01-matrix_1_AC.cpp
 
 
1-bit-and-2-bit-characters_1_AC.cpp
1-bit-and-2-bit-characters_1_AC.cpp
 
 
132-pattern_1_AC.cpp
132-pattern_1_AC.cpp
 
 
2-keys-keyboard_1_AC.cpp
2-keys-keyboard_1_AC.cpp
 
 
3sum-closest_1_AC.cpp
3sum-closest_1_AC.cpp
 
 
3sum-smaller_1_AC.cpp
3sum-smaller_1_AC.cpp
 
 
3sum_1_AC.cpp
3sum_1_AC.cpp
 
 
4sum-ii_1_AC.cpp
4sum-ii_1_AC.cpp
 
 
4sum_1_AC.cpp
4sum_1_AC.cpp
 
 
README.md
README.md
 
 
add-and-search-word-data-structure-design_1_AC.cpp
add-and-search-word-data-structure-design_1_AC.cpp
 
 
add-binary_1_AC.cpp
add-binary_1_AC.cpp
 
 
add-digits_1_AC.cpp
add-digits_1_AC.cpp
 
 
add-one-row-to-tree_1_AC.cpp
add-one-row-to-tree_1_AC.cpp
 
 
add-strings_1_AC.cpp
add-strings_1_AC.cpp
 
 
add-two-numbers-ii_1_AC.cpp
add-two-numbers-ii_1_AC.cpp
 
 
add-two-numbers_1_AC.cpp
add-two-numbers_1_AC.cpp
 
 
additive-number_1_AC.cpp
additive-number_1_AC.cpp
 
 
alien-dictionary_1_AC.cpp
alien-dictionary_1_AC.cpp
 
 
all-oone-data-structure_1_AC.cpp
all-oone-data-structure_1_AC.cpp
 
 
anagrams_1_AC.cpp
anagrams_1_AC.cpp
 
 
android-unlock-patterns_1_AC.cpp
android-unlock-patterns_1_AC.cpp
 
 
arithmetic-slices-ii-subsequence_1_AC.cpp
arithmetic-slices-ii-subsequence_1_AC.cpp
 
 
arithmetic-slices_1_AC.cpp
arithmetic-slices_1_AC.cpp
 
 
arranging-coins_1_AC.cpp
arranging-coins_1_AC.cpp
 
 
array-nesting_1_AC.cpp
array-nesting_1_AC.cpp
 
 
array-partition-i_1_AC.cpp
array-partition-i_1_AC.cpp
 
 
assign-cookies_1_AC.cpp
assign-cookies_1_AC.cpp
 
 
asteroid-collision_1_AC.cpp
asteroid-collision_1_AC.cpp
 
 
average-of-levels-in-binary-tree_1_AC.cpp
average-of-levels-in-binary-tree_1_AC.cpp
 
 
balanced-binary-tree_1_AC.cpp
balanced-binary-tree_1_AC.cpp
 
 
base-7_1_AC.cpp
base-7_1_AC.cpp
 
 
baseball-game_1_AC.cpp
baseball-game_1_AC.cpp
 
 
basic-calculator-ii_1_AC.cpp
basic-calculator-ii_1_AC.cpp
 
 
basic-calculator_1_AC.cpp
basic-calculator_1_AC.cpp
 
 
battleships-in-a-board_1_AC.cpp
battleships-in-a-board_1_AC.cpp
 
 
beautiful-arrangement-ii_1_AC.cpp
beautiful-arrangement-ii_1_AC.cpp
 
 
beautiful-arrangement_1_AC.cpp
beautiful-arrangement_1_AC.cpp
 
 
best-meeting-point_1_AC.cpp
best-meeting-point_1_AC.cpp
 
 
best-time-to-buy-and-sell-stock-ii_1_AC.cpp
best-time-to-buy-and-sell-stock-ii_1_AC.cpp
 
 
best-time-to-buy-and-sell-stock-iii_1_AC.cpp
best-time-to-buy-and-sell-stock-iii_1_AC.cpp
 
 
best-time-to-buy-and-sell-stock-iv_1_AC.cpp
best-time-to-buy-and-sell-stock-iv_1_AC.cpp
 
 
best-time-to-buy-and-sell-stock-iv_2_AC.cpp
best-time-to-buy-and-sell-stock-iv_2_AC.cpp
 
 
best-time-to-buy-and-sell-stock-with-cooldown_1_AC.cpp
best-time-to-buy-and-sell-stock-with-cooldown_1_AC.cpp
 
 
best-time-to-buy-and-sell-stock-with-transaction-fee_1_AC.cpp
best-time-to-buy-and-sell-stock-with-transaction-fee_1_AC.cpp
 
 
best-time-to-buy-and-sell-stock_1_AC.cpp
best-time-to-buy-and-sell-stock_1_AC.cpp
 
 
binary-number-with-alternating-bits_1_AC.cpp
binary-number-with-alternating-bits_1_AC.cpp
 
 
binary-search-tree-iterator_1_AC.cpp
binary-search-tree-iterator_1_AC.cpp
 
 
binary-tree-inorder-traversal_1_AC.cpp
binary-tree-inorder-traversal_1_AC.cpp
 
 
binary-tree-inorder-traversal_2_AC.cpp
binary-tree-inorder-traversal_2_AC.cpp
 
 
binary-tree-level-order-traversal-ii_1_AC.cpp
binary-tree-level-order-traversal-ii_1_AC.cpp
 
 
binary-tree-level-order-traversal_1_AC.cpp
binary-tree-level-order-traversal_1_AC.cpp
 
 
binary-tree-level-order-traversal_2_AC.cpp
binary-tree-level-order-traversal_2_AC.cpp
 
 
binary-tree-longest-consecutive-sequence_1_AC.cpp
binary-tree-longest-consecutive-sequence_1_AC.cpp
 
 
binary-tree-maximum-path-sum_1_AC.cpp
binary-tree-maximum-path-sum_1_AC.cpp
 
 
binary-tree-paths_1_AC.cpp
binary-tree-paths_1_AC.cpp
 
 
binary-tree-postorder-traversal_1_AC.cpp
binary-tree-postorder-traversal_1_AC.cpp
 
 
binary-tree-postorder-traversal_2_AC.cpp
binary-tree-postorder-traversal_2_AC.cpp
 
 
binary-tree-preorder-traversal_1_AC.cpp
binary-tree-preorder-traversal_1_AC.cpp
 
 
binary-tree-preorder-traversal_2_AC.cpp
binary-tree-preorder-traversal_2_AC.cpp
 
 
binary-tree-right-side-view_1_AC.cpp
binary-tree-right-side-view_1_AC.cpp
 
 
binary-tree-right-side-view_2_AC.cpp
binary-tree-right-side-view_2_AC.cpp
 
 
binary-tree-tilt_1_AC.cpp
binary-tree-tilt_1_AC.cpp
 
 
binary-tree-upside-down_1_AC.cpp
binary-tree-upside-down_1_AC.cpp
 
 
binary-tree-vertical-order-traversal_1_AC.cpp
binary-tree-vertical-order-traversal_1_AC.cpp
 
 
binary-tree-zigzag-level-order-traversal_1_AC.cpp
binary-tree-zigzag-level-order-traversal_1_AC.cpp
 
 
binary-watch_1_AC.cpp
binary-watch_1_AC.cpp
 
 
bitwise-and-of-numbers-range_1_AC.cpp
bitwise-and-of-numbers-range_1_AC.cpp
 
 
bomb-enemy_1_AC.cpp
bomb-enemy_1_AC.cpp
 
 
brick-wall_1_AC.cpp
brick-wall_1_AC.cpp
 
 
bulb-switcher-ii_1_AC.cpp
bulb-switcher-ii_1_AC.cpp
 
 
bulb-switcher_1_AC.cpp
bulb-switcher_1_AC.cpp
 
 
bulls-and-cows_1_AC.cpp
bulls-and-cows_1_AC.cpp
 
 
burst-balloons_1_AC.cpp
burst-balloons_1_AC.cpp
 
 
can-i-win_1_AC.cpp
can-i-win_1_AC.cpp
 
 
can-place-flowers_1_AC.cpp
can-place-flowers_1_AC.cpp
 
 
candy_1_AC.cpp
candy_1_AC.cpp
 
 
climbing-stairs_1_AC.cpp
climbing-stairs_1_AC.cpp
 
 
clone-graph_1_AC.cpp
clone-graph_1_AC.cpp
 
 
closest-binary-search-tree-value-ii_1_AC.cpp
closest-binary-search-tree-value-ii_1_AC.cpp
 
 
closest-binary-search-tree-value_1_AC.cpp
closest-binary-search-tree-value_1_AC.cpp
 
 
coin-change_1_AC.cpp
coin-change_1_AC.cpp
 
 
combination-sum-ii_1_AC.cpp
combination-sum-ii_1_AC.cpp
 
 
combination-sum-iii_1_AC.cpp
combination-sum-iii_1_AC.cpp
 
 
combination-sum-iv_1_AC.cpp
combination-sum-iv_1_AC.cpp
 
 
combination-sum_1_AC.cpp
combination-sum_1_AC.cpp
 
 
combinations_1_AC.cpp
combinations_1_AC.cpp
 
 
combinations_2_AC.cpp
combinations_2_AC.cpp
 
 
compare-version-numbers_1_AC.cpp
compare-version-numbers_1_AC.cpp
 
 
complex-number-multiplication_1_AC.cpp
complex-number-multiplication_1_AC.cpp
 
 
concatenated-words_1_AC.cpp
concatenated-words_1_AC.cpp
 
 
construct-binary-tree-from-inorder-and-postorder-traversal_1_AC.cpp
construct-binary-tree-from-inorder-and-postorder-traversal_1_AC.cpp
 
 
construct-binary-tree-from-preorder-and-inorder-traversal_1_AC.cpp
construct-binary-tree-from-preorder-and-inorder-traversal_1_AC.cpp
 
 
construct-binary-tree-from-string_1_AC.cpp
construct-binary-tree-from-string_1_AC.cpp
 
 
construct-string-from-binary-tree_1_AC.cpp
construct-string-from-binary-tree_1_AC.cpp
 
 
construct-the-rectangle_1_AC.cpp
construct-the-rectangle_1_AC.cpp
 
 
contain-virus_1_AC.cpp
contain-virus_1_AC.cpp
 
 
container-with-most-water_1_AC.cpp
container-with-most-water_1_AC.cpp
 
 
contains-duplicate-ii_1_AC.cpp
contains-duplicate-ii_1_AC.cpp
 
 
contains-duplicate-iii_1_AC.cpp
contains-duplicate-iii_1_AC.cpp
 
 

Repository files navigation

leetcode-2

Leetcode revision, premium problems included.

This is a repo containing my accepted codes on Leetcode.

It was originally created as a revision practice repo, to make sure my skills on handling data structure and algorithm problems don't get rusty.

As I've spent quite a bit of time finishing hundreds of problems on it, this repo is now my main repo for Leetcode.

If my code proves useful to you in any way, I'm glad to know that. Feel free to upvote and bookmark my Zhihu article down below. As it'll be updated from time to time.

If you find anything buggy or worth a bit of discussion in my codes, please leave a comment in the corresponding article at my Zhihu article.

Please visit my Leetcode memo for more information.

Wish you good luck in landing your dream job offer as software engineers/data scientists/research scientists/quantitative researchers/algorithmic traders/blabla.

As long as your job description includes writing codes, you'll have to face this kind of FUBAR sooner or later. So let's get it done.

If there's anything I've learned from the past twenty-or-so years in my life (as a loser, of course), it's "live on and dream on".

You gotta eat, so you write codes. You gotta dream, so you always have something worth living for. Tell you what, I'm gonna be a musician someday.

向死而生。

Zhu Li, at Tsinghua University.
2018.1.24 16:25:50

About

Leetcode revision.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages

  • C++ 100.0%