46. Permutations

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

Example:

Input: [1,2,3]
Output:
[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]

方法1: DFS

一开始还在想dfs之前应该取出当前值，递归调用，然后再放回去，要如何保证放回去还是原来的位置？不用！set就自动ordered了。数据结构还是不熟练。。。
?王：https://www.youtube.com/watch?v=43w8tXWKSLw

易错点：

但是最好不要动原数组，先取出再放回的方法出问题了。还是单建一个set用来快速查找有没有用过该元素，array也可以。虽然下面这个视频用的是取出放回的这个方法。should work。
https://www.youtube.com/watch?v=KukNnoN-SoY

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> result;
        if (nums.size() == 0) return result;
        
        // set<int> subset(nums.begin(), nums.end());
        set<int> subset;
        vector<int> current;
        permuteHelper(result, current, subset,nums);
        return result;
    }  
        
    void permuteHelper(vector<vector<int>> & result, vector<int> & current, set<int> & subset, vector<int> & nums) {
            if (current.size() == nums.size()) {
                result.push_back(current);
                return;
            }
            
            for (int i: nums){
                if (subset.find(i) == subset.end()){
                     current.push_back(i);
                     
                     subset.insert(i);
                     permuteHelper(result, current, subset, nums);
                     subset.erase(i);
                    
                     current.pop_back();
                }
            }
     return;
    }
};

方法2: swap

discussion

class Solution {
public:
    vector<vector<int> > permute(vector<int> &num) {
	    vector<vector<int> > result;
	    
	    permuteRecursive(num, 0, result);
	    return result;
    }
    
    // permute num[begin..end]
    // invariant: num[0..begin-1] have been fixed/permuted
	void permuteRecursive(vector<int> &num, int begin, vector<vector<int> > &result)	{
		if (begin >= num.size()) {
		    // one permutation instance
		    result.push_back(num);
		    return;
		}
		
		for (int i = begin; i < num.size(); i++) {
		    swap(num[begin], num[i]);
		    permuteRecursive(num, begin + 1, result);
		    // reset
		    swap(num[begin], num[i]);
		}
    }
};