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
bojan's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:48:26
import java.util.HashMap; public class TrainRoute { public String findActualSchedule(String plannedSchedule, String updates) { String arr[] = new String[52]; String arr1[] = new String[102]; arr = plannedSchedule.split(" "); if( updates.length() != 0 ) arr1 = updates.split(" "); HashMap<String, String> hash = new HashMap<String, String>(); for( int i=0; i < arr.length; i+=2 ) { hash.put(arr[i], arr[i+1]); } for( int i=0; i < arr1.length; i+=2 ) { hash.put(arr1[i], arr1[i+1]); } String buff = ""; for( int i=0; i < arr.length; i+=2 ) { buff = buff + arr[i] + " " + hash.get(arr[i]) + " "; } return buff.trim(); } }