文章目录1.next_permutation2.prev_permutationSTL提供了两个用来计算排列组合关系的算法分别是next_permutation和prev_permutation。1.next_permutation//获得之后的字典序#includeiostream#includealgorithmusingnamespacestd;inta[3]{1,2,3};intmain(){do{couta[0] a[1] a[2]endl;}while(next_permutation(a,a3));}//执行结果1231322132313123212.prev_permutation//获得之前的字典序#includeiostream#includealgorithmusingnamespacestd;inta[3]{3,2,1};intmain(){do{couta[0] a[1] a[2]endl;}while(prev_permutation(a,a3));}//执行结果321312231213132123