Register
|
Login
Home
News
Competitions
Practice
How to
Rankings
Calendar
Arena
CodeFu 2010
CodeFu'10 Highlights
Jazoon'10 Highlights
Schedule
Rules
Prizes
Results
Competitions
»
Main CodeFu Competitons
»
CodeFu 2010
»
Results
CodeFu 2010 Results
Final Round Results
bPop's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:30:07
import java.util.HashMap; import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.StringTokenizer; public class TrainRoute { public String findActualSchedule(String plannedSchedule, String updates){ String rez = ""; Map<String, String> mapa = new HashMap<String, String>(); StringTokenizer st = new StringTokenizer(plannedSchedule); List<String> trainNames = new LinkedList<String>(); while(st.hasMoreTokens()){ String train = st.nextToken(); trainNames.add(train); String time = st.nextToken(); mapa.put(train, time); } st = new StringTokenizer(updates); while(st.hasMoreTokens()){ String train = st.nextToken(); String time = st.nextToken(); mapa.put(train, time); } for (String name:trainNames) { String time = mapa.get(name); rez += name + " " + time + " "; } return rez.trim(); } public static void main(String[] args) { System.out.println(new TrainRoute().findActualSchedule("A 09:00 B 10:03 C 11:07 D 12:13 E 14:20", "C 11:09 C 11:08 A 09:01")); } }