Re-translate the Japanese version (#1871)

* Retranslate Japanese docs with GPT-5.4

* Retranslate Japanese code with GPT-5.4

ja/codes/go/chapter_backtracking/permutations_i.go

@@ -0,0 +1,38 @@
+// File: permutations_i.go
+// Created Time: 2023-05-14
+// Author: Reanon (793584285@qq.com)
+
+package chapter_backtracking
+
+/* バックトラッキング：順列 I */
+func backtrackI(state *[]int, choices *[]int, selected *[]bool, res *[][]int) {
+	// 状態の長さが要素数に等しければ、解を記録
+	if len(*state) == len(*choices) {
+		newState := append([]int{}, *state...)
+		*res = append(*res, newState)
+	}
+	// すべての選択肢を走査
+	for i := 0; i < len(*choices); i++ {
+		choice := (*choices)[i]
+		// 枝刈り：要素の重複選択を許可しない
+		if !(*selected)[i] {
+			// 試行: 選択を行い、状態を更新
+			(*selected)[i] = true
+			*state = append(*state, choice)
+			// 次の選択へ進む
+			backtrackI(state, choices, selected, res)
+			// バックトラック：選択を取り消し、前の状態に戻す
+			(*selected)[i] = false
+			*state = (*state)[:len(*state)-1]
+		}
+	}
+}
+
+/* 全順列 I */
+func permutationsI(nums []int) [][]int {
+	res := make([][]int, 0)
+	state := make([]int, 0)
+	selected := make([]bool, len(nums))
+	backtrackI(&state, &nums, &selected, &res)
+	return res
+}