'commit'

C++专题课程/深度优先搜索/顺序输出全排列.cpp

@@ -0,0 +1,31 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+
+int p[10]= {0};
+bool vis[10]= {0};
+int n;
+void dfs(int x) {
+	if (x==n+1) {
+		for(int i=1; i<=n; i++)
+			cout<<p[i]<<" ";
+		cout<<endl;
+		return ;
+	}
+	//˳<><CBB3><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD>֦<EFBFBD><D6A6> 
+	for (int i=1; i<=n; i++) {
+		if (vis[i]==false  && i>p[x]) { //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>룬Ҳ<EBA3AC><D2B2><EFBFBD>Ǽ<EFBFBD>֦<EFBFBD><D6A6><EFBFBD><EFBFBD><EFBFBD>Ա<EFBFBD><D4B1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĵݹ<C4B5>
+			p[x] = i;
+			vis[i] = true;
+
+			dfs(x+1);
+			vis[i] = false;
+		}
+	}
+}
+
+int main() {
+	n=4;
+	dfs(1);
+	return 0;
+}