全排列

给定一个数字列表，返回其所有可能的排列。

class Solution {
public:
    /*
     * @param nums: A list of integers.
     * @return: A list of permutations.
     */
    vector> permute(vector &nums) {
        // write your code here
        vector> result;
        sort(nums.begin(),nums.end());
        permuteRec( 0, nums, result);
        return result;
    }
    
    void permuteRec( int start, vector nums, vector> &result ){
        if( start >= nums.size()){
            result.push_back(nums);
            return;
        }
        for( int i = start; i < nums.size(); i++ ){
            if( i > start && nums[i] == nums[start]) continue;
            swap( nums[start], nums[i] );
            permuteRec( start+1, nums, result);
        }
    }
};