332.重新安排行程
题目链接:https://leetcode.cn/problems/reconstruct-itinerary/submissions/
代码:
class Solution {
public:
// unordered_map<出发机场, map<到达机场, 航班次数>> targets
unordered_map<string, map<string, int>> targets;
vector<string> findItinerary(vector<vector<string>>& tickets) {
vector<string> result;
targets.clear();
for(const vector<string>& vec : tickets)
{
targets[vec[0]][vec[1]]++;
}
result.push_back("JFK");
disdant(tickets.size(),result);
return result;
}
bool disdant(int ticketNum, vector<string>& result)
{
if(result.size() == ticketNum + 1)
return true;
for(pair<const string,int>& target : targets[result[result.size() - 1]])
{
if(target.second > 0)
{
result.push_back(target.first);
target.second--;
if (disdant(ticketNum, result)) return true;
result.pop_back();
target.second++;
}
}
return false;
}
};
不会啊不会 看着代码还是迷迷糊糊
51. N皇后
题目链接:https://leetcode.cn/problems/n-queens/
代码:
37. 解数独
题目链接:
代码: