c++ combination by next_permutation

#include <iostream>
#include <algorithm>
#include <vector>

int main() {
    int n, r;
    n = 10;
    r = 2;

    std::vector<bool> v(n);
    std::fill(v.end() - r, v.end(), true);
    std::vector< std::vector<int> > sequence_vector;

    do {
        std::vector<int> sequence;
        for (int i = 0; i < n; ++i) {
            if (v[i]) {
                std::cout << (i + 1) << " ";
                sequence.push_back(i+1);
            }
        }
        std::cout << "\n";
        sequence_vector.push_back(sequence);
    } while (std::next_permutation(v.begin(), v.end()));

    std::cout<<"from vector"<<std::endl;

    std::vector<int>::iterator iterator_sequence;
    std::vector< std::vector<int> >::iterator iterator_sequence_vector;
    for(iterator_sequence_vector = sequence_vector.begin();
      iterator_sequence_vector != sequence_vector.end(); iterator_sequence_vector++){
      for (iterator_sequence = (*iterator_sequence_vector).begin();
        iterator_sequence !=  (*iterator_sequence_vector).end(); iterator_sequence++){
        std::cout<<*iterator_sequence<<" ";
      }
      std::cout<<std::endl;
    }

    return 0;
}

 

转载于:https://www.cnblogs.com/youge-OneSQL/p/9487305.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值