leetcode/PermutationsII3.cpp at master · jiangshen95/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include<iostream>
#include<vector>

using namespace std;

class Solution {
public:
    vector<vector<int> > permuteUnique(vector<int>& nums) {

        vector<vector<int> > result;

        vector_qsort(nums,0,nums.size()-1);

        result.push_back(nums);

        int i,j;
        while(1){

        	for(i=nums.size()-1;i>0;i--){
        		if(nums[i-1]<nums[i]){
        			break;
				}
			}

			if(i==0) break;

			for(j=nums.size()-1;j>i-1;j--){
				if(nums[j]>nums[i-1]){
					break;
				}
			}

			swap(nums[i-1],nums[j]);
			vector_reserve(nums,i,nums.size()-1);

			result.push_back(nums);

		}


		return result;


    }

    void vector_qsort(vector<int>& nums,int l,int r){
    	if(l<r){
    		int i=l,j=r;
    		int v=nums[l];
    		while(i<j){
    			while(i<j&&nums[j]>=v) j--;
    			nums[i]=nums[j];
    			while(i<j&&nums[i]<=v) i++;
    			nums[j]=nums[i];
			}
			nums[i]=v;
			vector_qsort(nums,l,i);
			vector_qsort(nums,i+1,r);
		}
	}

	void swap(int& x,int& y){
		int v=x;
		x=y;
		y=v;
	}

	void vector_reserve(vector<int>& nums,int l,int r){
    	while(l<r){
    		int v=nums[l];
    		nums[l]=nums[r];
    		nums[r]=v;
    		l++;
    		r--;
		}
	}

};

int main(){

	int n;
	cin>>n;

	vector<int> nums;
	for(int i=0;i<n;i++){
		int num;
		cin>>num;
		nums.push_back(num);
	}

	Solution *solution=new Solution();
	vector<vector<int> > result=solution->permuteUnique(nums);

	for(int i=0;i<result.size();i++){
		for(int j=0;j<result[i].size();j++){
			cout<<result[i][j]<<", ";
		}
		cout<<endl;
	}

	return 0;

}