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
BojanKostadinov's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:31:11
import java.util.ArrayList; import java.util.HashMap; import java.util.StringTokenizer; public class TrainRoute { public String fix(String schedule) { // StringBuilder builder = new StringBuilder(schedule); // for (int i=0; i<builder.length(); i++) // (builder.charAt(i) == ':') // builder.setCharAt(i, ' '); // return builder.toString(); return schedule; } public String findActualSchedule(String plannedSchedule, String updates) { String planned = fix(plannedSchedule); String updated = fix(updates); ArrayList<String> order = new ArrayList<String>(); HashMap<String, String> time = new HashMap<String, String>(); StringTokenizer ptokenizer = new StringTokenizer(planned); // int pos = 0; while (ptokenizer.hasMoreTokens()) { String name = ptokenizer.nextToken(); String t = ptokenizer.nextToken(); order.add(name); time.put(name, t); } StringTokenizer stokenizer = new StringTokenizer(updated); while (stokenizer.hasMoreTokens()) { String name = stokenizer.nextToken(); String t = stokenizer.nextToken(); // order.add(name); time.put(name, t); } StringBuilder result = new StringBuilder(); for (String station : order) { result.append(station + " "); result.append(time.get(station) + " "); } return result.toString().trim(); } }