From cf83819278ee212f4ea53bdd1dd8edecfcab23f6 Mon Sep 17 00:00:00 2001 From: krahets Date: Sat, 1 Jul 2023 03:04:10 +0800 Subject: [PATCH] deploy --- .DS_Store | Bin 12292 -> 12292 bytes 404.html | 10 +- assets/covers/chapter_introduction.jpg | Bin 136640 -> 138805 bytes assets/covers/chapter_preface.jpg | Bin 122632 -> 121206 bytes chapter_appendix/contribution/index.html | 10 +- chapter_appendix/installation/index.html | 14 +- chapter_array_and_linkedlist/array/index.html | 10 +- chapter_array_and_linkedlist/index.html | 10 +- .../linked_list/index.html | 10 +- chapter_array_and_linkedlist/list/index.html | 10 +- .../summary/index.html | 10 +- .../backtracking_algorithm/index.html | 10 +- chapter_backtracking/index.html | 10 +- .../n_queens_problem/index.html | 10 +- .../permutations_problem/index.html | 10 +- .../subset_sum_problem/index.html | 10 +- chapter_backtracking/summary/index.html | 10 +- chapter_computational_complexity/index.html | 10 +- .../performance_evaluation/index.html | 10 +- .../space_complexity/index.html | 10 +- .../summary/index.html | 10 +- .../time_complexity/index.html | 10 +- .../basic_data_types/index.html | 10 +- .../character_encoding/index.html | 10 +- .../index.html | 10 +- chapter_data_structure/index.html | 10 +- .../number_encoding/index.html | 10 +- chapter_data_structure/summary/index.html | 10 +- chapter_dynamic_programming/index.html | 14 +- .../climbing_stairs_constraint_example.png | Bin 0 -> 72034 bytes ...mbing_stairs_constraint_state_transfer.png | Bin 0 -> 64797 bytes .../climbing_stairs_state_transfer.png | Bin 62905 -> 62431 bytes .../intro_to_dynamic_programming/index.html | 200 +++++++++++++++--- chapter_graph/graph/index.html | 10 +- chapter_graph/graph_operations/index.html | 10 +- chapter_graph/graph_traversal/index.html | 10 +- chapter_graph/index.html | 10 +- chapter_graph/summary/index.html | 10 +- chapter_hashing/hash_algorithm/index.html | 10 +- chapter_hashing/hash_collision/index.html | 10 +- chapter_hashing/hash_map/index.html | 10 +- chapter_hashing/index.html | 10 +- chapter_hashing/summary/index.html | 10 +- chapter_heap/build_heap/index.html | 10 +- chapter_heap/heap/index.html | 10 +- chapter_heap/index.html | 10 +- chapter_heap/summary/index.html | 10 +- chapter_heap/top_k/index.html | 10 +- .../algorithms_are_everywhere/index.html | 14 +- chapter_introduction/index.html | 18 +- chapter_introduction/summary/index.html | 10 +- chapter_introduction/what_is_dsa/index.html | 18 +- chapter_preface/about_the_book/index.html | 14 +- chapter_preface/index.html | 18 +- chapter_preface/suggestions/index.html | 10 +- chapter_preface/summary/index.html | 14 +- chapter_reference/index.html | 10 +- chapter_searching/binary_search/index.html | 10 +- .../binary_search_edge/index.html | 10 +- chapter_searching/index.html | 10 +- .../replace_linear_by_hashing/index.html | 10 +- .../searching_algorithm_revisited/index.html | 10 +- chapter_searching/summary/index.html | 10 +- chapter_sorting/bubble_sort/index.html | 10 +- chapter_sorting/bucket_sort/index.html | 10 +- chapter_sorting/counting_sort/index.html | 10 +- chapter_sorting/heap_sort/index.html | 10 +- chapter_sorting/index.html | 10 +- chapter_sorting/insertion_sort/index.html | 10 +- chapter_sorting/merge_sort/index.html | 10 +- chapter_sorting/quick_sort/index.html | 10 +- chapter_sorting/radix_sort/index.html | 10 +- chapter_sorting/selection_sort/index.html | 10 +- chapter_sorting/sorting_algorithm/index.html | 10 +- chapter_sorting/summary/index.html | 10 +- chapter_stack_and_queue/deque/index.html | 10 +- chapter_stack_and_queue/index.html | 10 +- chapter_stack_and_queue/queue/index.html | 10 +- chapter_stack_and_queue/stack/index.html | 10 +- chapter_stack_and_queue/summary/index.html | 10 +- .../array_representation_of_tree/index.html | 10 +- chapter_tree/avl_tree/index.html | 10 +- chapter_tree/binary_search_tree/index.html | 10 +- chapter_tree/binary_tree/index.html | 10 +- chapter_tree/binary_tree_traversal/index.html | 10 +- chapter_tree/index.html | 10 +- chapter_tree/summary/index.html | 10 +- index.html | 19 +- search/search_index.json | 2 +- sitemap.xml | 162 +++++++------- sitemap.xml.gz | Bin 800 -> 800 bytes 91 files changed, 689 insertions(+), 538 deletions(-) create mode 100644 chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_constraint_example.png create mode 100644 chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_constraint_state_transfer.png diff --git a/.DS_Store b/.DS_Store index 886ed5efbbff7ba96e863b309feaccfeb1dde8bd..0323beaf44aaa11da25c017f4caa0aea6d61f143 100644 GIT binary patch literal 12292 zcmeHNPly{;82?5$>$=%uN@eR>vFUiJ7WWw|bzZl(uzIi1d0MV63yZlI_m8%y)eF7# zy?gttTHnX9>hB7~x6<&;U1vNqA$VNgdC-tNwea>ZU5Vl6tqTE$NZ)c#BaXfn_n|8s z_x(oP%zqoZCUq*)Dr(zkkvg5%a7-UvNn$H;y?2jGEEH!-d8;sBF zCoQ~nP4)H-j)$*ZJu%us;<}Q$7T_B39NA{^tu#EfMaHw&=#MR6;dkpCc6E#Bk!8pW z7-3v4+WWT9`6RgqiT91en*rX0aY+2*d(rqftfoD44CgV{9YB8aiI;#pQdeS}x%5kb zafp7uhsM#@;^s&=7Jj$Nh_pjbqTO2fbJ3D5t;N!hrH1LsxaU9m?m6CjAFkhzJC42< zcltWVeJ|dg*AZzGe-#zK9x*-gZMc?3JMl%2uL!>~%F)_d zy#A6-MQu-(0n318z%ua9U|=3$Odvm4#$4N$vsr3=?RQxxXN#}ytmphppl2)Rhp>7% zBc#6GV)T=dSxN4_cL(d`^Y_o(2r?1Phm0XgN5(<XYy5*C!Pb^GIEIuXB8UW2S4~` zJH8|jKVJJI;9>08BtJXhPvdPL(-yL`QUYhZ{^88uyE50UPe1-~5?jg3<%eg36@j_4 z67g)w!#MUD?q?Pmch=}HOUT7*coSBEyojRqlWEaxv}$qR9+%k`uENMe*q`F!w>)f literal 12292 zcmeHNQHWGk82)dq&V*Y|rX}jbZD}EVsNDz(3>{@fM5+y;9x~n8nQ?b?#+hbzWh10{ z2!g;~dMQir!QKigdI*AA(iTAwLtiApeNbAWVkHoI3BUi`d*}XV&fJ-M*M+D(cR2SS z&iVgy|L;5J-us{b9wKsfO&5lVo+P3)3d>ACPVW)9YaqqJ?OcrGe$+T9qbT^FA<9vW zrl?4DI%H^@75AZv?fX#HQ=TR@`w|^PUv;Wdfu_+qMJ4<{R;iARjF+q9ut|UP;pp|h zZ=TcD@j15};s%d9V(o>Zo= zQKpcdspBs(9M2r}E~`UkecAM+XHJf1PL6+N$6uj1>gup_l{z_DPujC(z%pPmuoYDa z*52V7yS4UCU@zC;l)B8`tTopCHLUrIbQrmSJQd3m;i{c7`G0y_$o#^HIBw#1!93!&Aw?IeN^Pj}2hqd+R82bUBPy0rE{`*os`Vu^S$HK6wuk z@0EpT1H1|SkocG0i^j(@qs&LY!3XCUi*3kX{O$8@x)Nh`?9~8cWZx1^9DU92m(O^9 z^SxDor!&ZC=BR;R5hK~qMl3adR{0&FEB*f9v)_MFxl`sOQa^ku#?jaOPOJI%0PddS z@U)I!N%^mPOoNxl-Jw16`RfPh z?6f^B1C{~HfMvikU>W#NGB60QTi?iK{ImL0oTI~)GlL))Z8q(M(h<8 z$3F4xKzqBq{*H5h1hK2uhx8#zNBTj7i|j|nSQGF*h8iL;j<`!SBYB~|zYfH)k^XMJ zuseufdtOUoNMfhqTBTy|Egf)i9G*j*8Ls`xD*8VPv;{<;C5}Tiyqn(n26&g;m*io` zcjEyM_t0M$?Jq}v8gHBC0Tr3&_Pr>1tYRvd5z}hz?C(SYk7e)}v~lD<1O5=jYy7zf ze_oD0C68ac^l`xBJ^L!>+j91+@#?Dk>`{Z)0yyMs#38l%sr&nUrg=rKaky^rQ*fBb zUh?(I)lUMx67~_!wWao<@$g8E=huS<4-@LHtkI-~dfWPI-L)mgAJ%U7_Cj^-UygP> z3(fx*l>cVNi+67Es@2T@^}ov)dRRytr` - 0.     写在前面 + 0.     前言