From 37523d4cebac51cb62ec8a5ea8a1ab61b6f4725d Mon Sep 17 00:00:00 2001 From: krahets Date: Sun, 29 Mar 2026 02:26:00 +0800 Subject: [PATCH] build --- ja/docs/chapter_appendix/index.md | 2 +- ja/docs/chapter_backtracking/index.md | 2 +- .../chapter_computational_complexity/index.md | 2 +- ja/docs/chapter_data_structure/index.md | 4 +- ja/docs/chapter_divide_and_conquer/index.md | 2 +- ja/docs/chapter_dynamic_programming/index.md | 8 +- ja/docs/chapter_greedy/index.md | 2 +- ja/docs/chapter_heap/index.md | 4 +- ja/docs/chapter_preface/index.md | 2 +- ja/docs/chapter_searching/index.md | 4 +- ja/docs/chapter_tree/index.md | 2 +- overrides/partials/comments.html | 17 +- ru/docs/chapter_appendix/contribution.md | 53 + ru/docs/chapter_appendix/index.md | 14 + ru/docs/chapter_appendix/installation.md | 76 + ru/docs/chapter_appendix/terminology.md | 145 + ru/docs/chapter_array_and_linkedlist/array.md | 1589 ++++++ ru/docs/chapter_array_and_linkedlist/index.md | 22 + .../linked_list.md | 1556 ++++++ ru/docs/chapter_array_and_linkedlist/list.md | 2301 +++++++++ .../ram_and_cache.md | 83 + .../chapter_array_and_linkedlist/summary.md | 90 + .../backtracking_algorithm.md | 2159 ++++++++ ru/docs/chapter_backtracking/index.md | 22 + .../chapter_backtracking/n_queens_problem.md | 793 +++ .../permutations_problem.md | 1182 +++++ .../subset_sum_problem.md | 1790 +++++++ ru/docs/chapter_backtracking/summary.md | 27 + .../chapter_computational_complexity/index.md | 22 + .../iteration_and_recursion.md | 2134 ++++++++ .../performance_evaluation.md | 53 + .../space_complexity.md | 2508 ++++++++++ .../summary.md | 59 + .../time_complexity.md | 4397 +++++++++++++++++ .../basic_data_types.md | 183 + .../character_encoding.md | 97 + .../classification_of_data_structure.md | 58 + ru/docs/chapter_data_structure/index.md | 22 + .../chapter_data_structure/number_encoding.md | 162 + ru/docs/chapter_data_structure/summary.md | 70 + .../binary_search_recur.md | 488 ++ .../build_binary_tree_problem.md | 595 +++ .../divide_and_conquer.md | 101 + .../hanota_problem.md | 610 +++ ru/docs/chapter_divide_and_conquer/index.md | 22 + ru/docs/chapter_divide_and_conquer/summary.md | 17 + .../dp_problem_features.md | 976 ++++ .../dp_solution_pipeline.md | 1623 ++++++ .../edit_distance_problem.md | 1080 ++++ ru/docs/chapter_dynamic_programming/index.md | 24 + .../intro_to_dynamic_programming.md | 1683 +++++++ .../knapsack_problem.md | 1558 ++++++ .../chapter_dynamic_programming/summary.md | 29 + .../unbounded_knapsack_problem.md | 2432 +++++++++ ru/docs/chapter_graph/graph.md | 103 + ru/docs/chapter_graph/graph_operations.md | 2407 +++++++++ ru/docs/chapter_graph/graph_traversal.md | 1037 ++++ ru/docs/chapter_graph/index.md | 21 + ru/docs/chapter_graph/summary.md | 35 + .../fractional_knapsack_problem.md | 580 +++ ru/docs/chapter_greedy/greedy_algorithm.md | 414 ++ ru/docs/chapter_greedy/index.md | 22 + .../chapter_greedy/max_capacity_problem.md | 451 ++ .../max_product_cutting_problem.md | 417 ++ ru/docs/chapter_greedy/summary.md | 18 + ru/docs/chapter_hashing/hash_algorithm.md | 1095 ++++ ru/docs/chapter_hashing/hash_collision.md | 3334 +++++++++++++ ru/docs/chapter_hashing/hash_map.md | 1808 +++++++ ru/docs/chapter_hashing/index.md | 21 + ru/docs/chapter_hashing/summary.md | 55 + ru/docs/chapter_heap/build_heap.md | 388 ++ ru/docs/chapter_heap/heap.md | 2206 +++++++++ ru/docs/chapter_heap/index.md | 21 + ru/docs/chapter_heap/summary.md | 21 + ru/docs/chapter_heap/top_k.md | 503 ++ ru/docs/chapter_hello_algo/index.md | 30 + .../algorithms_are_everywhere.md | 66 + ru/docs/chapter_introduction/index.md | 20 + ru/docs/chapter_introduction/summary.md | 28 + ru/docs/chapter_introduction/what_is_dsa.md | 65 + ru/docs/chapter_preface/about_the_book.md | 60 + ru/docs/chapter_preface/index.md | 20 + ru/docs/chapter_preface/suggestions.md | 259 + ru/docs/chapter_preface/summary.md | 14 + ru/docs/chapter_reference/index.md | 25 + ru/docs/chapter_searching/binary_search.md | 747 +++ .../chapter_searching/binary_search_edge.md | 530 ++ .../binary_search_insertion.md | 707 +++ ru/docs/chapter_searching/index.md | 23 + .../replace_linear_by_hashing.md | 570 +++ .../searching_algorithm_revisited.md | 94 + ru/docs/chapter_searching/summary.md | 14 + ru/docs/chapter_sorting/bubble_sort.md | 634 +++ ru/docs/chapter_sorting/bucket_sort.md | 477 ++ ru/docs/chapter_sorting/counting_sort.md | 929 ++++ ru/docs/chapter_sorting/heap_sort.md | 654 +++ ru/docs/chapter_sorting/index.md | 28 + ru/docs/chapter_sorting/insertion_sort.md | 302 ++ ru/docs/chapter_sorting/merge_sort.md | 747 +++ ru/docs/chapter_sorting/quick_sort.md | 1634 ++++++ ru/docs/chapter_sorting/radix_sort.md | 788 +++ ru/docs/chapter_sorting/selection_sort.md | 346 ++ ru/docs/chapter_sorting/sorting_algorithm.md | 52 + ru/docs/chapter_sorting/summary.md | 53 + ru/docs/chapter_stack_and_queue/deque.md | 3632 ++++++++++++++ ru/docs/chapter_stack_and_queue/index.md | 21 + ru/docs/chapter_stack_and_queue/queue.md | 2314 +++++++++ ru/docs/chapter_stack_and_queue/stack.md | 1851 +++++++ ru/docs/chapter_stack_and_queue/summary.md | 35 + .../array_representation_of_tree.md | 1357 +++++ ru/docs/chapter_tree/avl_tree.md | 3368 +++++++++++++ ru/docs/chapter_tree/binary_search_tree.md | 1777 +++++++ ru/docs/chapter_tree/binary_tree.md | 698 +++ ru/docs/chapter_tree/binary_tree_traversal.md | 940 ++++ ru/docs/chapter_tree/index.md | 23 + ru/docs/chapter_tree/summary.md | 58 + ru/docs/index.html | 357 ++ ru/docs/index.md | 11 + 118 files changed, 74250 insertions(+), 21 deletions(-) create mode 100644 ru/docs/chapter_appendix/contribution.md create mode 100644 ru/docs/chapter_appendix/index.md create mode 100644 ru/docs/chapter_appendix/installation.md create mode 100644 ru/docs/chapter_appendix/terminology.md create mode 100644 ru/docs/chapter_array_and_linkedlist/array.md create mode 100644 ru/docs/chapter_array_and_linkedlist/index.md create mode 100644 ru/docs/chapter_array_and_linkedlist/linked_list.md create mode 100644 ru/docs/chapter_array_and_linkedlist/list.md create mode 100644 ru/docs/chapter_array_and_linkedlist/ram_and_cache.md create mode 100644 ru/docs/chapter_array_and_linkedlist/summary.md create mode 100644 ru/docs/chapter_backtracking/backtracking_algorithm.md create mode 100644 ru/docs/chapter_backtracking/index.md create mode 100644 ru/docs/chapter_backtracking/n_queens_problem.md create mode 100644 ru/docs/chapter_backtracking/permutations_problem.md create mode 100644 ru/docs/chapter_backtracking/subset_sum_problem.md create mode 100644 ru/docs/chapter_backtracking/summary.md create mode 100644 ru/docs/chapter_computational_complexity/index.md create mode 100644 ru/docs/chapter_computational_complexity/iteration_and_recursion.md create mode 100644 ru/docs/chapter_computational_complexity/performance_evaluation.md create mode 100644 ru/docs/chapter_computational_complexity/space_complexity.md create mode 100644 ru/docs/chapter_computational_complexity/summary.md create mode 100644 ru/docs/chapter_computational_complexity/time_complexity.md create mode 100644 ru/docs/chapter_data_structure/basic_data_types.md create mode 100644 ru/docs/chapter_data_structure/character_encoding.md create mode 100644 ru/docs/chapter_data_structure/classification_of_data_structure.md create mode 100644 ru/docs/chapter_data_structure/index.md create mode 100644 ru/docs/chapter_data_structure/number_encoding.md create mode 100644 ru/docs/chapter_data_structure/summary.md create mode 100644 ru/docs/chapter_divide_and_conquer/binary_search_recur.md create mode 100644 ru/docs/chapter_divide_and_conquer/build_binary_tree_problem.md create mode 100644 ru/docs/chapter_divide_and_conquer/divide_and_conquer.md create mode 100644 ru/docs/chapter_divide_and_conquer/hanota_problem.md create mode 100644 ru/docs/chapter_divide_and_conquer/index.md create mode 100644 ru/docs/chapter_divide_and_conquer/summary.md create mode 100644 ru/docs/chapter_dynamic_programming/dp_problem_features.md create mode 100644 ru/docs/chapter_dynamic_programming/dp_solution_pipeline.md create mode 100644 ru/docs/chapter_dynamic_programming/edit_distance_problem.md create mode 100644 ru/docs/chapter_dynamic_programming/index.md create mode 100644 ru/docs/chapter_dynamic_programming/intro_to_dynamic_programming.md create mode 100644 ru/docs/chapter_dynamic_programming/knapsack_problem.md create mode 100644 ru/docs/chapter_dynamic_programming/summary.md create mode 100644 ru/docs/chapter_dynamic_programming/unbounded_knapsack_problem.md create mode 100644 ru/docs/chapter_graph/graph.md create mode 100644 ru/docs/chapter_graph/graph_operations.md create mode 100644 ru/docs/chapter_graph/graph_traversal.md create mode 100644 ru/docs/chapter_graph/index.md create mode 100644 ru/docs/chapter_graph/summary.md create mode 100644 ru/docs/chapter_greedy/fractional_knapsack_problem.md create mode 100644 ru/docs/chapter_greedy/greedy_algorithm.md create mode 100644 ru/docs/chapter_greedy/index.md create mode 100644 ru/docs/chapter_greedy/max_capacity_problem.md create mode 100644 ru/docs/chapter_greedy/max_product_cutting_problem.md create mode 100644 ru/docs/chapter_greedy/summary.md create mode 100644 ru/docs/chapter_hashing/hash_algorithm.md create mode 100644 ru/docs/chapter_hashing/hash_collision.md create mode 100644 ru/docs/chapter_hashing/hash_map.md create mode 100644 ru/docs/chapter_hashing/index.md create mode 100644 ru/docs/chapter_hashing/summary.md create mode 100644 ru/docs/chapter_heap/build_heap.md create mode 100644 ru/docs/chapter_heap/heap.md create mode 100644 ru/docs/chapter_heap/index.md create mode 100644 ru/docs/chapter_heap/summary.md create mode 100644 ru/docs/chapter_heap/top_k.md create mode 100644 ru/docs/chapter_hello_algo/index.md create mode 100644 ru/docs/chapter_introduction/algorithms_are_everywhere.md create mode 100644 ru/docs/chapter_introduction/index.md create mode 100644 ru/docs/chapter_introduction/summary.md create mode 100644 ru/docs/chapter_introduction/what_is_dsa.md create mode 100644 ru/docs/chapter_preface/about_the_book.md create mode 100644 ru/docs/chapter_preface/index.md create mode 100644 ru/docs/chapter_preface/suggestions.md create mode 100644 ru/docs/chapter_preface/summary.md create mode 100644 ru/docs/chapter_reference/index.md create mode 100644 ru/docs/chapter_searching/binary_search.md create mode 100644 ru/docs/chapter_searching/binary_search_edge.md create mode 100644 ru/docs/chapter_searching/binary_search_insertion.md create mode 100644 ru/docs/chapter_searching/index.md create mode 100644 ru/docs/chapter_searching/replace_linear_by_hashing.md create mode 100644 ru/docs/chapter_searching/searching_algorithm_revisited.md create mode 100644 ru/docs/chapter_searching/summary.md create mode 100644 ru/docs/chapter_sorting/bubble_sort.md create mode 100644 ru/docs/chapter_sorting/bucket_sort.md create mode 100644 ru/docs/chapter_sorting/counting_sort.md create mode 100644 ru/docs/chapter_sorting/heap_sort.md create mode 100644 ru/docs/chapter_sorting/index.md create mode 100644 ru/docs/chapter_sorting/insertion_sort.md create mode 100644 ru/docs/chapter_sorting/merge_sort.md create mode 100644 ru/docs/chapter_sorting/quick_sort.md create mode 100644 ru/docs/chapter_sorting/radix_sort.md create mode 100644 ru/docs/chapter_sorting/selection_sort.md create mode 100644 ru/docs/chapter_sorting/sorting_algorithm.md create mode 100644 ru/docs/chapter_sorting/summary.md create mode 100644 ru/docs/chapter_stack_and_queue/deque.md create mode 100644 ru/docs/chapter_stack_and_queue/index.md create mode 100644 ru/docs/chapter_stack_and_queue/queue.md create mode 100644 ru/docs/chapter_stack_and_queue/stack.md create mode 100644 ru/docs/chapter_stack_and_queue/summary.md create mode 100644 ru/docs/chapter_tree/array_representation_of_tree.md create mode 100644 ru/docs/chapter_tree/avl_tree.md create mode 100644 ru/docs/chapter_tree/binary_search_tree.md create mode 100644 ru/docs/chapter_tree/binary_tree.md create mode 100644 ru/docs/chapter_tree/binary_tree_traversal.md create mode 100644 ru/docs/chapter_tree/index.md create mode 100644 ru/docs/chapter_tree/summary.md create mode 100644 ru/docs/index.html create mode 100644 ru/docs/index.md diff --git a/ja/docs/chapter_appendix/index.md b/ja/docs/chapter_appendix/index.md index ab1180eb4..492484c86 100644 --- a/ja/docs/chapter_appendix/index.md +++ b/ja/docs/chapter_appendix/index.md @@ -10,5 +10,5 @@ icon: material/help-circle-outline ## 章の内容 - [16.1   プログラミング環境のインストール](installation.md) -- [16.2   一緒に創作に参加](contribution.md) +- [16.2   一緒に創作に参加する](contribution.md) - [16.3   用語集](terminology.md) diff --git a/ja/docs/chapter_backtracking/index.md b/ja/docs/chapter_backtracking/index.md index 4e3c7ac81..387254e7e 100644 --- a/ja/docs/chapter_backtracking/index.md +++ b/ja/docs/chapter_backtracking/index.md @@ -16,7 +16,7 @@ icon: material/map-marker-path ## 章の内容 - [13.1   バックトラッキングアルゴリズム](backtracking_algorithm.md) -- [13.2   順列問題](permutations_problem.md) +- [13.2   全順列問題](permutations_problem.md) - [13.3   部分集合和問題](subset_sum_problem.md) - [13.4   Nクイーン問題](n_queens_problem.md) - [13.5   まとめ](summary.md) diff --git a/ja/docs/chapter_computational_complexity/index.md b/ja/docs/chapter_computational_complexity/index.md index 838e1ac4b..ce25fccaf 100644 --- a/ja/docs/chapter_computational_complexity/index.md +++ b/ja/docs/chapter_computational_complexity/index.md @@ -15,7 +15,7 @@ icon: material/timer-sand ## 章の内容 -- [2.1   アルゴリズム効率評価](performance_evaluation.md) +- [2.1   アルゴリズムの効率評価](performance_evaluation.md) - [2.2   反復と再帰](iteration_and_recursion.md) - [2.3   時間計算量](time_complexity.md) - [2.4   空間計算量](space_complexity.md) diff --git a/ja/docs/chapter_data_structure/index.md b/ja/docs/chapter_data_structure/index.md index 068d46c7b..37e0bcea7 100644 --- a/ja/docs/chapter_data_structure/index.md +++ b/ja/docs/chapter_data_structure/index.md @@ -17,6 +17,6 @@ icon: material/shape-outline - [3.1   データ構造の分類](classification_of_data_structure.md) - [3.2   基本データ型](basic_data_types.md) -- [3.3   数値エンコーディング *](number_encoding.md) -- [3.4   文字エンコーディング *](character_encoding.md) +- [3.3   数値の符号化 *](number_encoding.md) +- [3.4   文字の符号化 *](character_encoding.md) - [3.5   まとめ](summary.md) diff --git a/ja/docs/chapter_divide_and_conquer/index.md b/ja/docs/chapter_divide_and_conquer/index.md index 54dd83d0a..63ea0d9c6 100644 --- a/ja/docs/chapter_divide_and_conquer/index.md +++ b/ja/docs/chapter_divide_and_conquer/index.md @@ -17,6 +17,6 @@ icon: material/set-split - [12.1   分割統治アルゴリズム](divide_and_conquer.md) - [12.2   分割統治探索戦略](binary_search_recur.md) -- [12.3   二分木構築問題](build_binary_tree_problem.md) +- [12.3   木の構築問題](build_binary_tree_problem.md) - [12.4   ハノイの塔問題](hanota_problem.md) - [12.5   まとめ](summary.md) diff --git a/ja/docs/chapter_dynamic_programming/index.md b/ja/docs/chapter_dynamic_programming/index.md index 87eb91db5..31bb6d91a 100644 --- a/ja/docs/chapter_dynamic_programming/index.md +++ b/ja/docs/chapter_dynamic_programming/index.md @@ -15,10 +15,10 @@ icon: material/table-pivot ## 章の内容 -- [14.1   動的プログラミング入門](intro_to_dynamic_programming.md) -- [14.2   DP問題の特性](dp_problem_features.md) -- [14.3   DP問題解決アプローチ](dp_solution_pipeline.md) +- [14.1   動的計画法の初歩](intro_to_dynamic_programming.md) +- [14.2   DP 問題の特性](dp_problem_features.md) +- [14.3   DP の解法の考え方](dp_solution_pipeline.md) - [14.4   0-1ナップサック問題](knapsack_problem.md) -- [14.5   無制限ナップサック問題](unbounded_knapsack_problem.md) +- [14.5   完全ナップサック問題](unbounded_knapsack_problem.md) - [14.6   編集距離問題](edit_distance_problem.md) - [14.7   まとめ](summary.md) diff --git a/ja/docs/chapter_greedy/index.md b/ja/docs/chapter_greedy/index.md index 54accdba0..ff4870a88 100644 --- a/ja/docs/chapter_greedy/index.md +++ b/ja/docs/chapter_greedy/index.md @@ -18,5 +18,5 @@ icon: material/head-heart-outline - [15.1   貪欲アルゴリズム](greedy_algorithm.md) - [15.2   分数ナップサック問題](fractional_knapsack_problem.md) - [15.3   最大容量問題](max_capacity_problem.md) -- [15.4   最大積切断問題](max_product_cutting_problem.md) +- [15.4   最大積分割問題](max_product_cutting_problem.md) - [15.5   まとめ](summary.md) diff --git a/ja/docs/chapter_heap/index.md b/ja/docs/chapter_heap/index.md index 0251b465e..eba589741 100644 --- a/ja/docs/chapter_heap/index.md +++ b/ja/docs/chapter_heap/index.md @@ -16,6 +16,6 @@ icon: material/family-tree ## 章の内容 - [8.1   ヒープ](heap.md) -- [8.2   ヒープの構築](build_heap.md) -- [8.3   Top-k問題](top_k.md) +- [8.2   ヒープ構築操作](build_heap.md) +- [8.3   Top-k 問題](top_k.md) - [8.4   まとめ](summary.md) diff --git a/ja/docs/chapter_preface/index.md b/ja/docs/chapter_preface/index.md index b0c05f108..b9ecef68b 100644 --- a/ja/docs/chapter_preface/index.md +++ b/ja/docs/chapter_preface/index.md @@ -15,6 +15,6 @@ icon: material/book-open-outline ## 章の内容 -- [0.1   この本について](about_the_book.md) +- [0.1   本書について](about_the_book.md) - [0.2   本書の使い方](suggestions.md) - [0.3   まとめ](summary.md) diff --git a/ja/docs/chapter_searching/index.md b/ja/docs/chapter_searching/index.md index 813aa8671..db26bd581 100644 --- a/ja/docs/chapter_searching/index.md +++ b/ja/docs/chapter_searching/index.md @@ -16,8 +16,8 @@ icon: material/text-search ## 章の内容 - [10.1   二分探索](binary_search.md) -- [10.2   二分探索挿入点](binary_search_insertion.md) +- [10.2   二分探索の挿入点](binary_search_insertion.md) - [10.3   二分探索の境界](binary_search_edge.md) - [10.4   ハッシュ最適化戦略](replace_linear_by_hashing.md) -- [10.5   探索アルゴリズム再考](searching_algorithm_revisited.md) +- [10.5   探索アルゴリズムの再認識](searching_algorithm_revisited.md) - [10.6   まとめ](summary.md) diff --git a/ja/docs/chapter_tree/index.md b/ja/docs/chapter_tree/index.md index 4af25206a..4772a7fe3 100644 --- a/ja/docs/chapter_tree/index.md +++ b/ja/docs/chapter_tree/index.md @@ -17,7 +17,7 @@ icon: material/graph-outline - [7.1   二分木](binary_tree.md) - [7.2   二分木の走査](binary_tree_traversal.md) -- [7.3   木の配列表現](array_representation_of_tree.md) +- [7.3   二分木の配列表現](array_representation_of_tree.md) - [7.4   二分探索木](binary_search_tree.md) - [7.5   AVL木 *](avl_tree.md) - [7.6   まとめ](summary.md) diff --git a/overrides/partials/comments.html b/overrides/partials/comments.html index 6f02cdf8c..4a2f570c2 100755 --- a/overrides/partials/comments.html +++ b/overrides/partials/comments.html @@ -8,12 +8,21 @@ {% elif config.theme.language == 'en' %} {% set comm = "Feel free to drop your insights, questions or suggestions" %} {% set lang = "en" %} + {% elif config.theme.language == 'ja' %} + {% set comm = "ご意見、ご質問、ご提案があればぜひコメントしてください" %} + {% set lang = "ja" %} + {% elif config.theme.language == 'ru' %} + {% set comm = "Оставляйте свои идеи, вопросы и предложения в комментариях" %} + {% set lang = "ru" %} {% endif %} - + + + {% include "partials/checkin.html" ignore missing %} +
{{ comm }}
-