Re-translate the Japanese version (#1871)

* Retranslate Japanese docs with GPT-5.4

* Retranslate Japanese code with GPT-5.4

ja/codes/swift/chapter_backtracking/permutations_i.swift

@@ -0,0 +1,50 @@
+/**
+ * File: permutations_i.swift
+ * Created Time: 2023-04-30
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* バックトラッキング：順列 I */
+func backtrack(state: inout [Int], choices: [Int], selected: inout [Bool], res: inout [[Int]]) {
+    // 状態の長さが要素数に等しければ、解を記録
+    if state.count == choices.count {
+        res.append(state)
+        return
+    }
+    // すべての選択肢を走査
+    for (i, choice) in choices.enumerated() {
+        // 枝刈り：要素の重複選択を許可しない
+        if !selected[i] {
+            // 試行: 選択を行い、状態を更新
+            selected[i] = true
+            state.append(choice)
+            // 次の選択へ進む
+            backtrack(state: &state, choices: choices, selected: &selected, res: &res)
+            // バックトラック：選択を取り消し、前の状態に戻す
+            selected[i] = false
+            state.removeLast()
+        }
+    }
+}
+
+/* 全順列 I */
+func permutationsI(nums: [Int]) -> [[Int]] {
+    var state: [Int] = []
+    var selected = Array(repeating: false, count: nums.count)
+    var res: [[Int]] = []
+    backtrack(state: &state, choices: nums, selected: &selected, res: &res)
+    return res
+}
+
+@main
+enum PermutationsI {
+    /* Driver Code */
+    static func main() {
+        let nums = [1, 2, 3]
+
+        let res = permutationsI(nums: nums)
+
+        print("入力配列 nums = \(nums)")
+        print("すべての順列 res = \(res)")
+    }
+}