Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Permutations CPP #12

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
yanglbme merged 1 commit into doocs:master from zhkmxx9302013:master
Oct 9, 2018
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Permutations CPP
排列数,模板题
  • Loading branch information
zhkmxx9302013 authored Oct 9, 2018
commit fc3c9ad297c45c1705967fd5fd95f713fb76d6f7
35 changes: 35 additions & 0 deletions solution/046.Permutations/Solution.cpp
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
if (nums.size() == 0) return{};
vector<vector<int>> res;
vector<int> curr_vec;
vector<bool> used;
for (int i = 0; i < nums.size(); i++)
{
used.push_back(false);
}
dfs(res, nums, 0, curr_vec, used);
return res;
}

void dfs(vector<vector<int>>& res, vector<int>& nums, int depth, vector<int> curr_vec, vector<bool> used)
{

if (depth >= nums.size())
{
res.emplace_back(curr_vec);
return;
}

for (int i = 0; i < nums.size(); i++)
{
if (used[i]) continue;
used[i] = true;
curr_vec.emplace_back(nums[i]);
dfs(res, nums, depth + 1, curr_vec, used);
curr_vec.pop_back();
used[i] = false;
}
}
};

AltStyle によって変換されたページ (->オリジナル) /