Leetcode 46. Permutations with C

最新推荐文章于 2024-04-23 09:31:34 发布

爱水的鱼1988

最新推荐文章于 2024-04-23 09:31:34 发布

阅读量615

点赞数

分类专栏： Leetcode 文章标签： Leetcode 题库 c语言

本文链接：https://blog.csdn.net/u012618247/article/details/53981481

版权

Leetcode 专栏收录该内容

12 篇文章 1 订阅

订阅专栏

46. Permutations

Given a collection of distinct numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:

[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]

Subscribe to see which companies asked this question

/**
 * Return an array of arrays of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
 
 void swap_num(int *a, int *b)
 {
     int temp = *a;
     *a = *b;
     *b = temp;
 }
 
 void permut(int **result, int *nums, int end, int *rows, int beg)
 {
     int i;
     if (beg == end) //已经是最后一个元素，递归返回
     {
         (*rows)--;
         for(i = 0; i != end; i++)
            result[(*rows)][i] = nums[i];
     }
     else
     {
         for (i = beg; i != end; i++)
         {
             swap_num(&nums[beg], &nums[i]);
             permut(result,nums, end, rows, beg+1);
             swap_num(&nums[beg], &nums[i]);
         }
     }
     
 }
 
int** permute(int* nums, int numsSize, int* returnSize) {
    int **result, i;
    *returnSize = 1;
    /* 计算全排列数 */
    for(i = numsSize; i > 1; i--)
    {
        (*returnSize) *= i;
    }
    /* 为行分配内存 */
    result = (int **)malloc((*returnSize)*sizeof(int *)); //6 行
    /* 为列分配内存 */
    for (i = 0; i != (*returnSize); i++)
        *(result + i) = (int *)malloc(numsSize * sizeof(int)); //3列
        
        int rows = *returnSize;
        permut(result, nums, numsSize, &rows, 0);
        return result;
    
}