leetcode 刷题之路 12 Permutations

最新推荐文章于 2024-02-28 13:59:57 发布

BurningWall

最新推荐文章于 2024-02-28 13:59:57 发布

阅读量465

点赞数

分类专栏： leetcode leetcode刷题之路

本文链接：https://blog.csdn.net/u013140542/article/details/38147379

版权

leetcode刷题之路同时被 2 个专栏收录

92 篇文章 2 订阅

订阅专栏

leetcode

88 篇文章 0 订阅

订阅专栏

Given a collection of 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], and [3,2,1].

全排列问题，详细分析参考这篇文章，这里不再赘述，直接贴出代码。

class Solution {
public:
	vector<vector<int> > permute(vector<int> &num)
	{
		vector<vector<int>> result;
		helper(num, result, 0, num.size());
		return result;
	}
	static void helper(vector<int> &num,vector<vector<int>> &result, int current, int len)
	{
		if (current == len)
		{
			result.push_back(num);
			return;
		}
		for (int i = current; i < len; i++)
		{
			swap(num[current], num[i]);
			helper(num, result, current + 1, len);
			swap(num[current], num[i]);
		}
	}
	static void swap(int &a, int &b)
	{
		int temp = a;
		a = b;
		b = temp;
	}
};