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
darkomk's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:44:43
import java.util.LinkedList; public class TrainRoute { LinkedList<String> train; LinkedList<String> time; public String findActualSchedule(String plannedSchedule, String updates) { train=new LinkedList(); time=new LinkedList(); String []S1=plannedSchedule.split(" "); for (int i=0;i<S1.length;i=i+2) { train.add(S1[i]); time.add(S1[i+1]); } if(updates.length()>0) { S1=updates.split(" "); for (int i=0;i<S1.length;i=i+2) { time.set(train.indexOf(S1[i]), S1[i+1]); } } String rez=""; for (int i=0;i<train.size()-1;i++) rez=rez+train.get(i)+" "+time.get(i)+" "; rez=rez+train.get(train.size()-1)+" "+time.get(time.size()-1); return rez; } public static void main(String[] args) { TrainRoute t=new TrainRoute(); String s1="A 09:00 B 10:03 C 11:07 D 12:13 E 14:20"; String s2=""; t.findActualSchedule(s1, s2); } }