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
pub struct Permutations {
arr: Vec<usize>,
start: bool
}
impl Permutations {
pub fn new(n: usize) -> Self {
Permutations{arr: (0..n).collect::<Vec<usize>>(), start: true}
}
}
impl Iterator for Permutations {
type Item = Vec<usize>;
fn next(&mut self) -> Option<Vec<usize>> {
if self.start {
self.start = false;
return Some(self.arr.clone());
}
for i in (1 .. self.arr.len()).rev() {
if self.arr[i - 1] < self.arr[i] {
for j in (i .. self.arr.len()).rev() {
if self.arr[j] > self.arr[i - 1] {
self.arr.swap(i - 1, j);
self.arr[i .. ].reverse();
return Some(self.arr.clone());
}
}
}
}
None
}
}
#[test]
fn test() {
let per = Permutations::new(3);
let arr = vec![[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]];
let mut counter = 0;
for (i, value) in per.into_iter().enumerate() {
counter += 1;
assert_eq!(vec![value[0], value[1], value[2]], arr[i]);
}
assert_eq!(counter, arr.len());
}