Leetcode 332.重新安排行程
题意
在有向图中,对于确定起点求一条字典序最小的欧拉迹
题解
Hierholzer算法求解欧拉迹
建图加边后对每个点的出边进行排序
dfs,每次搜索后标记当前边不能再次通过
无路可走时将当前点加入栈中,回溯
将栈内的点逆序输出即可
代码
#include<bits/stdc++.h>
const int MAXN = 1e7 + 50;
map<string,int>id;
map<int,string>name;
vector<string>euler_road;
vector<pair<int,int> >e[MAXN];
bool vis[MAXN];
int tot = 1;
bool cmp(pair<int,int> a,pair<int,int> b){
string p = name[a.first] , q = name[b.first];
for(int i = 0 ; i < min(p.size(),q.size()) ; i ++){
if(p[i] < q[i]) return true;
if(p[i] > q[i]) return false;
}
return p.size() < q.size();
}
void dfs(int u){
for(int i = 0 ; i < e[u].size() ; i ++){
int v = e[u][i].first , edge = e[u][i].second;
if(vis[edge]) continue;
vis[edge] = vis[edge ^ 1] = 1;
dfs(v);
}
euler_road.push_back(name[u]);
}
vector<string>res;
class Solution {
public:
vector<string> findItinerary(vector<vector<string>>& tickets) {
int n = 0;
id.clear() , euler_road.clear() , name.clear() ,res.clear();
memset(e,0,sizeof(e));
for(int i = 0 ; i < tickets.size() ; i ++){
string x = tickets[i][0] , y = tickets[i][1];
if(id.find(x) == id.end()){
id[x] = ++n;
name[n] = x;
}
if(id.find(y) == id.end()){
id[y] = ++n;
name[n] = y;
}
e[id[x]].push_back(make_pair(id[y],++tot));
e[id[y]].push_back(make_pair(id[x],++tot));
}
for(int i = 1 ; i <= n ; i ++){
sort(e[i].begin(),e[i].end(),cmp);
}
int s = 0;
for(int i = 1 ; i <= n ; i++){
if(name[i] == "JFK"){
s = i;
break;
}
}
dfs(s);
for(int i = euler_road.size() - 1 ; i >= 0 ; i --){
res.push_back(euler_road[i]);
}
return res;
}
};