docs: add Japanese translate documents (#1812)

* docs: add Japanese documents (`ja/docs`) * docs: add Japanese documents (`ja/codes`) * docs: add Japanese documents * Remove pythontutor blocks in ja/ * Add an empty at the end of each markdown file. * Add the missing figures (use the English version temporarily). * Add index.md for Japanese version. * Add index.html for Japanese version. * Add missing index.assets * Fix backtracking_algorithm.md for Japanese version. * Add avatar_eltociear.jpg. Fix image links on the Japanese landing page. * Add the Japanese banner. --------- Co-authored-by: krahets <krahets@163.com>
2025-11-02 21:24:53 +08:00 · 2025-10-17 06:04:43 +09:00
parent 2487a27036
commit 954c45864b
886 changed files with 33569 additions and 0 deletions
--- a/ja/codes/cpp/chapter_backtracking/permutations_ii.cpp
+++ b/ja/codes/cpp/chapter_backtracking/permutations_ii.cpp
@ -0,0 +1,56 @@
+/**
+ * File: permutations_ii.cpp
+ * Created Time: 2023-04-24
+ * Author: krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* バックトラッキングアルゴリズム：順列 II */
+void backtrack(vector<int> &state, const vector<int> &choices, vector<bool> &selected, vector<vector<int>> &res) {
+    // 状態の長さが要素数と等しくなったら、解を記録
+    if (state.size() == choices.size()) {
+        res.push_back(state);
+        return;
+    }
+    // すべての選択肢を走査
+    unordered_set<int> duplicated;
+    for (int i = 0; i < choices.size(); i++) {
+        int choice = choices[i];
+        // 剪定：要素の重複選択を許可せず、等しい要素の重複選択も許可しない
+        if (!selected[i] && duplicated.find(choice) == duplicated.end()) {
+            // 試行：選択を行い、状態を更新
+            duplicated.emplace(choice); // 選択された要素値を記録
+            selected[i] = true;
+            state.push_back(choice);
+            // 次のラウンドの選択に進む
+            backtrack(state, choices, selected, res);
+            // 回退：選択を取り消し、前の状態に復元
+            selected[i] = false;
+            state.pop_back();
+        }
+    }
+}
+
+/* 順列 II */
+vector<vector<int>> permutationsII(vector<int> nums) {
+    vector<int> state;
+    vector<bool> selected(nums.size(), false);
+    vector<vector<int>> res;
+    backtrack(state, nums, selected, res);
+    return res;
+}
+
+/* ドライバーコード */
+int main() {
+    vector<int> nums = {1, 1, 2};
+
+    vector<vector<int>> res = permutationsII(nums);
+
+    cout << "入力配列 nums = ";
+    printVector(nums);
+    cout << "すべての順列 res = ";
+    printVectorMatrix(res);
+
+    return 0;
+}