Files
hello-algo/ja/codes/c/chapter_backtracking/permutations_i.c
Yudong Jin 7257641e0e Retranslate the complete Japanese online edition from Chinese (#2008)
* Retranslate the complete Japanese online edition from Chinese

* Fit Japanese homepage labels and localize heading permalinks

* Point Japanese contribution instructions to the Japanese preview

* Replace locale conditionals with multilingual UI tables
2026-10-30 02:12:26 +08:00

80 lines
2.3 KiB
C

/**
* File: permutations_i.c
* Created Time: 2023-06-04
* Author: Gonglja (glj0@outlook.com), krahets (krahets@163.com)
*/
#include "../utils/common.h"
// 順列は最大 1000 個と仮定する
#define MAX_SIZE 1000
/* バックトラッキング:すべての順列 I */
void backtrack(int *state, int stateSize, int *choices, int choicesSize, bool *selected, int **res, int *resSize) {
// 状態の長さが要素数と等しくなったら、解を記録する
if (stateSize == choicesSize) {
res[*resSize] = (int *)malloc(choicesSize * sizeof(int));
for (int i = 0; i < choicesSize; i++) {
res[*resSize][i] = state[i];
}
(*resSize)++;
return;
}
// すべての選択肢を走査する
for (int i = 0; i < choicesSize; i++) {
int choice = choices[i];
// 枝刈り:同じ要素を繰り返し選んではならない
if (!selected[i]) {
// 試行:選択を行い、状態を更新する
selected[i] = true;
state[stateSize] = choice;
// 次の選択に進む
backtrack(state, stateSize + 1, choices, choicesSize, selected, res, resSize);
// 復元:選択を取り消し、以前の状態に戻す
selected[i] = false;
}
}
}
/* すべての順列 I */
int **permutationsI(int *nums, int numsSize, int *returnSize) {
int *state = (int *)malloc(numsSize * sizeof(int));
bool *selected = (bool *)malloc(numsSize * sizeof(bool));
for (int i = 0; i < numsSize; i++) {
selected[i] = false;
}
int **res = (int **)malloc(MAX_SIZE * sizeof(int *));
*returnSize = 0;
backtrack(state, 0, nums, numsSize, selected, res, returnSize);
free(state);
free(selected);
return res;
}
/* 実行用コード */
int main() {
int nums[] = {1, 2, 3};
int numsSize = sizeof(nums) / sizeof(nums[0]);
int returnSize;
int **res = permutationsI(nums, numsSize, &returnSize);
printf("入力配列 nums = ");
printArray(nums, numsSize);
printf("\nすべての順列 res = \n");
for (int i = 0; i < returnSize; i++) {
printArray(res[i], numsSize);
}
// メモリを解放する
for (int i = 0; i < returnSize; i++) {
free(res[i]);
}
free(res);
return 0;
}