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
alpetrovski's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:38:35
public class TrainRoute { public String findActualSchedule(String plannedSchedule, String updates) { char[] plannedS = new char[25]; String[] plannedT = new String[25]; int stations = 0; int cur = 0; while(cur<plannedSchedule.length()) { plannedS[stations] = plannedSchedule.charAt(cur); cur += 2; plannedT[stations] = plannedSchedule.substring(cur, cur+5); cur += 6; stations++; } cur=0; while(cur<updates.length()) { char S = updates.charAt(cur); cur += 2; String update = updates.substring(cur, cur+5); cur += 6; for(int i=0;i<stations;i++) { if(plannedS[i] == S){ plannedT[i] = update; break; } } } String rez = ""; for(int i=0;i<stations;i++) { if(i>0) rez= rez.concat(" "); rez = rez.concat((String.valueOf(plannedS[i]).concat(" ").concat(plannedT[i]))); //System.out.println(String.valueOf(plannedS[i]).concat(" ").concat(plannedT[i])); } return rez; } }