Example #1
0
int main() {
	vector<int> v;
	v.push_back(1);
	v.push_back(2);
	v.push_back(3);

	Solution s;

	s.nextPermutation(v);
    for (int i = 0; i < v.size(); i ++) {
        cout << v[i];
    }
    cout << endl;

    s.nextPermutation(v);
    for (int i = 0; i < v.size(); i ++) {
        cout << v[i];
    }
    cout << endl;

    s.nextPermutation(v);
    for (int i = 0; i < v.size(); i ++) {
        cout << v[i];
    }
    cout << endl;

    s.nextPermutation(v);
    for (int i = 0; i < v.size(); i ++) {
        cout << v[i];
    }
    cout << endl;

	return 0;
}
Example #2
0
int main() {
	{
		vector<int> v{1, 2, 3};
		Solution s;
		s.nextPermutation(v);
		for (auto x : v)
			cout << x << " ";
		cout << endl;
	}
	{
		vector<int> v{3, 2, 1};
		Solution s;
		s.nextPermutation(v);
		for (auto x : v)
			cout << x << " ";
		cout << endl;
	}
	{
		vector<int> v{1, 1, 5};
		Solution s;
		s.nextPermutation(v);
		for (auto x : v)
			cout << x << " ";
		cout << endl;
	}
	return 0;
}
Example #3
0
int main()
{
    {
        std::vector<int> data;
        data.push_back(1); data.push_back(2); data.push_back(3);
        Solution s;
        s.nextPermutation(data);
        print(data);
    }
    {
        std::vector<int> data;
        data.push_back(3); data.push_back(2); data.push_back(1);
        Solution s;
        s.nextPermutation(data);
        print(data);
    }
    {
        std::vector<int> data;
        data.push_back(1); data.push_back(5); data.push_back(1);
        Solution s;
        s.nextPermutation(data);
        print(data);
    }
    return 0;
}
    void RunTests()
    {
        Solution s;
        vector<int> s1 = { 1, 3, 2 };
        s.nextPermutation(s1);

        vector<int> s2 = { 1, 1, 5 };
        s.nextPermutation(s2);
    }
/* -------------- test body --------------- */
TEST(nextPermutationTest, Positive01){
    Solution s;

    const int rows = 6, cols = 3;
    int arr[][cols] = {
        {1, 2, 3},
        {1, 3, 2},
        {2, 1, 3},
        {2, 3, 1},
        {3, 1, 2},
        {3, 2, 1}};

    for(int i = 0; i < rows; i++){
        vector<int> num(arr[i], arr[i] + cols);
        s.nextPermutation(num);

        int j = (i+1) % rows;
        vector<int> expected(arr[j], arr[j] + cols);

        assertList(expected, num);

        expected.clear();
        num.clear();
    }
}
Example #6
0
int main()
{
    int t = 0;
    cin >> t;
    for (int c = 0;c < t;++c)
    {
        int N, M, K;
        cin >> N >> M >> K;
        if (K > totalNum(N, M)) {
            cout << "Impossible" << endl;
        }
        else {
            Solution s;
            string str = "";
            str.append(N, '0');
            str.append(M, '1');
            for (int i=0;i<K-1;++i) {
                s.nextPermutation(str);
            }

            cout << str << endl;
        }
    }
    return 0;
}
Example #7
0
int main() {
    Solution sol;
    vector<int> nums = {5,1,4,3,2};
    sol.nextPermutation(nums);
    for (int item : nums) 
        cout << item << " ";
    cout << endl;
}
int main(){
	//cout << "hello";
	int A[] = {1,5,1};
	vector<int> v = vector<int>(A,A+3);
	Solution s = Solution();
	s.nextPermutation(v);
	print_vector(v);
}
Example #9
0
int main(void)
{
	int nums[] = {2,1,2,2,2,2,2,1};
	int nums1[] = {4, 3, 2, 1};
	int nums2[] = {1, 3, 4, 5, 8, 4, 3};
	vector<int> vnums(nums, nums + sizeof(nums) / sizeof(nums[0]));
	vector<int> vnums1(nums1, nums1 + sizeof(nums1) / sizeof(nums1[0]));
	vector<int> vnums2(nums2, nums2 + sizeof(nums2) / sizeof(nums2[0]));
	Solution s;
	s.nextPermutation(vnums);
	Print(vnums);
	s.nextPermutation(vnums1);
	Print(vnums1);
	s.nextPermutation(vnums2);
	Print(vnums2);
	return 0;
}
Example #10
0
void test()
{
    vector<int> num({2,3,6,4,4,1});
    Solution sol;
    sol.nextPermutation(num);
    for(int i=0;i<num.size();++i)
        cout<<num[i]<<" ";
    cout<<endl;
}
Example #11
0
int main()
{
    Solution SO;
    int n[] = {3,2};
    vector <int > num;
    num.assign(n,n+sizeof(n)/sizeof(int));
    SO.nextPermutation(num);
    for (int i=0;i<num.size();i++)
        cout<<num[i]<<endl;
}
Example #12
0
int main() {
    int array[] = {1,1};
    vector<int> nums(array, array+sizeof(array)/sizeof(int));
    
    Solution s;
    s.nextPermutation(nums);
    display(nums);
    cout<<"Hello World"<<endl;
    return 0;
}
Example #13
0
int main()
{
    vector<int> num = {4,6,5,2,1};
    Solution s;
    s.nextPermutation(num);
    for(auto iter = num.begin(); iter != num.end(); iter++) {
        cout<<*iter<<" ";
    }
    return 0;
}
int main(int argc, char const *argv[])
{
	vector<int> num = {5,4,7,5,3,2}; 
	Solution sl;
	sl.nextPermutation(num);
	for(int i = 0; i<num.size();++i){
		cout<<num[i]<<"    -|-     "; 
	}
	return 0;
}
Example #15
0
int main(){
	Solution s;
	vector<int> v={1,2,3};
	for(int i=0;i<6;i++){
		for(auto &ele:v)
			cout<<ele<<" ";
		cout<<endl;
		s.nextPermutation(v);
	}
}
int main (char *argv[], int argc) {
	int arr[]={3,2,1};
	vector<int> v(arr, arr+sizeof(arr)/sizeof(int));
	Solution sol;
	sol.nextPermutation(v);
	for (int i=0; i<v.size(); i++) {
		cout << v[i] << " ";
	}
	return 0;
}
Example #17
0
int main()
{
	vector<int> num;
	num.push_back(1);
	num.push_back(2);
	Solution sol;
	sol.nextPermutation(num);
//	sort(num.begin()+1,num.end());
	cout << num[0]<< " " << num[1]<<endl;
	return 0;
}
Example #18
0
int main()
{
    Solution s;
    vector<int> n;
    n.push_back(1);
    n.push_back(3);
    n.push_back(2);
    n.push_back(1);
    s.nextPermutation(n);
    return 0;
}
Example #19
0
int main(int argc, char *argv[]){
    Solution sol;
    {
	vector<int> nums{4,2,0,2,3,2,0};
	sol.nextPermutation(nums);
	for(auto a: nums){
	    cout << a << " ";
	}
    }
    cout << endl;
    {
	vector<int> nums{1, 3, 2};
	sol.nextPermutation(nums);
	for(auto a: nums){
	    cout << a << " ";
	}
    }

    return 0;
}
Example #20
0
int main()
{
    Solution sol;
    int a[] = {1,2,3,4,5,6,7,8,9};
    vector<int> inp(a, a+9);
    sol.nextPermutation(inp);
    for(int i=0; i<inp.size(); i++)
        cout << inp[i] << " " ;
    cout << endl;
	return 0;
}
Example #21
0
int main(void)
{
    vector<int> nums;
    nums.push_back(2);
    nums.push_back(3);
    nums.push_back(1);
    Solution engine;
    engine.nextPermutation(nums);
    cout << nums[0] << nums[1] << nums[2] << '\n';
    return 0;
}
Example #22
0
int main(int argc, char **argv)
{
  int arr[3] = {1, 3, 2};
  vector<int> vec(arr + 0, arr + 3);
  Solution s;
  s.nextPermutation(vec);
  for (auto i : vec)
  {
    cout << i << endl;
  }
}  
int main() {
	Solution s;
	vector<int> num;
	num.push_back(1);
	num.push_back(2);
	num.push_back(3);
	s.nextPermutation(num);
	showVec(num);

	return 0;
}
Example #24
0
int main() {
    Solution s;
    vector<int> nums;
    nums = {5,4,7,5,3,2};
    s.nextPermutation(nums);
    cout << nums << endl;
    nums = {2, 3, 1};
    s.nextPermutation(nums);
    cout << nums << endl;
    nums = {1, 2, 3};
    s.nextPermutation(nums);
    cout << nums << endl;
    nums = {3, 2, 1};
    s.nextPermutation(nums);
    cout << nums << endl;
    nums = {1, 1, 5};
    s.nextPermutation(nums);
    cout << nums << endl;

    return 0;
}
Example #25
0
int main()
{
    Solution s;

    int a[] = {1,2};
    vector<int> v(a,a+2);
    s.nextPermutation(v);
    
    for(int i = 0;i < v.size();i++)
        cout << v[i] << endl;
    return 0;
}
Example #26
0
int main()
{
    std::ios::sync_with_stdio(false);
    vector<int> num({2,3,6,4,4,1});
    Solution sol;
    sol.nextPermutation(num);
    for(int i=0;i<num.size();++i)
        cout<<num[i]<<" ";
    cout<<endl;

    return 0;
}
Example #27
0
int main(){
	int value;
	std::vector<int> num;
	while(std::cin >> value){
		num.push_back(value);
	}
	Solution s;
	s.nextPermutation(num);
	printVector(num);
	std::cout << std::endl;
	return 0;
}
Example #28
0
int main() {
    Solution *s = new Solution();
    int myints[] = {1, 3, 2};
    std::vector<int> myvector (myints, myints + sizeof(myints) / sizeof(int) );
    s->nextPermutation(myvector);
    for (std::vector<int>::iterator it = myvector.begin(); it != myvector.end(); ++it){
        std::cout << ' ' << *it;
    }
    std::cout << '\n';

    return 0;
}
int main(){
	Solution sol;
	vector<int> num;
	num.push_back(1);
	num.push_back(3);
	num.push_back(2);
	sol.nextPermutation(num);
	for(int i=0;i<num.size();i++){
		cout<<num[i]<<" ";
	}
	cout<<endl;
	return 0;
}
Example #30
0
int main()
{
    Solution s;
    vector<int> v = { 1, 1, 3, 4 };
    for (int i = 0; i < 26; ++i)
    {
        s.nextPermutation(v);
        for (auto &c : v)
            cout << c << " ";
        cout << endl;
    }
    return 0;
}