题意
枚举每个字数,没有出现的最小正整数
思路
遍历+合并区间(可以使用启发式合并优化)
代码
class Solution {
public:
vector<int> smallestMissingValueSubtree(vector<int>& parents, vector<int>& nums) {
vector<vector<int>> child(parents.size(), vector<int>());
for (int i = 1; i< parents.size(); i++)
{
child[parents[i]].push_back(i);
}
vector<int> ans(parents.size(), 1);
solve(parents, nums, child, ans, 0);
return ans;
}
vector<pair<int, int>> solve(const vector<int>& parents,
const vector<int>& nums,
vector<vector<int>> &child,
vector<int> &ans,
int index
)
{
vector<pair<int, int>> return_tmp;
for (int i = 0; i < child[index].size(); i++)
{
vector<pair<int, int>> tmp = solve(parents, nums, child, ans, child[index][i]);
for (auto &j:tmp)
return_tmp.push_back(j);
}
return_tmp.push_back(make_pair(nums[index], nums[index]));
sort(return_tmp.begin(), return_tmp.end());
vector<pair<int, int>> return_set;
int i = 0;
while (i < return_tmp.size())
{
int begin = return_tmp[i].first;
int end = return_tmp[i].second;
while (i + 1 < return_tmp.size() && end + 1 == return_tmp[i + 1].first)
{
i++;
end = return_tmp[i].second;
}
return_set.push_back(make_pair(begin, end));
i++;
}
int ans_tmp = 1;
if (return_set[0].first == 1)
ans_tmp = return_set[0].second + 1;
ans[index] = ans_tmp;
return return_set;
}
};