数组全排列问题

void print(vector<int>a)//输出一次排列{for (int i = 0; i < a.size(); i++){cout << a[i];}cout << endl;}void DFS(int index, int n, vector<int>A){if (index >= n){print(a);return;//递归结束条件；}for (int i = 0; i < n; i++){if (!visit[i]){visit[i] = true;a[index] = A[i];DFS(index + 1, n,A);visit[i] = false;}}}