⏳ LeetCode for job
注意结果打印位置即可
while (root || !stack.empty()) {
while (root)
{
res.push_back(root->val);
stack.push(root);
root = root->left;
}
root = stack.top();
stack.pop();
root = root->right;
}
while (root || !stack.empty()) {
while (root) {
stack.push(root);
root = root->left;
}
root = stack.top();
stack.pop();
res.push_back(root->val);
root = root->right;
}
while (root || !stack.empty()) {
while (root) {
res.push_back(root->val);
stack.push(root);
root = root->right;
}
root = stack.top();
stack.pop();
root = root->left;
}
reverse(res.begin(), res.end());
for (int i = idx; i < candidates.size(); i++) {
if (rest - candidates[i] >= 0) {
path.push_back(candidates[i]);
dfs(candidates, rest - candidates[i], i);
path.pop_back();
}
}
used[i]
来表示已经选过避免重复for (int i = 0; i < nums.size(); i++) {
if (used[i])
continue;
used[i] = 1;
path.push_back(nums[i]);
dfs(nums);
path.pop_back();
used[i] = 0;
}
nums[i]==nums[i-1]
跳过选择避免重复for (int i = idx; i < candidates.size(); i++) {
// 同层不重复,同路径可以重复
if (i > idx && candidates[i] == candidates[i - 1])
continue;
...
}