DFS实现字符串全排列 —— C++详解

0. 代码实现

#include<iostream>
#include<string>
using namespace std;

void Permutation(string s, string str, bool visited[], int len) {
	if (str.length() == len) {
		cout << str << endl;
		return;
	}
	for (int i = 0; i < len; ++i) {
		if (!visited[i]) {
			visited[i] = true;
			Permutation(s, str + s[i], visited, len);
			visited[i] = false;
		}
	}
}

int main() {
	string s = "abc";
	int len = s.length();
	bool visited[len] = {false};
	string str = "";
	Permutation(s, str, visited, len);
	return 0;
}

1. 运行截图