#include <string>
#include <vector>
using namespace std;
vector<string> solution(vector<vector<string>> tickets) {
vector<string> answer;
string Here=tickets[0][0];
for(int i=0,n=ticket.size();i<n;i++){
answer[i]=Here;
vector<string> keep;
for(int j=0;i<n;j++){
if(tickets[j][0]==Here)
keep.push_back(tickets[j][0]);
}
string biggest=keep[0];
for(int j=1,m=keep.size();j<m;j++){
if(biggest>keep[j])
biggest=keep[j];
}
}
return answer;
}
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
여행경로(미완)
여행경로(미완)
댓글 0개
좋아요
댓글(0)
bottom of page