Competitions » Main CodeFu Competitons » CodeFu 2010 » Results

CodeFu 2010 Results

Final Round Results

VladD's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 13:08:51

import java.util.LinkedList;
import java.util.StringTokenizer;

public class TrainRoute {
  public String findActualSchedule(String plannedSchedule, String updates) {
	  String result="";
	  LinkedList <String> stations = new LinkedList<String>();
	  LinkedList <String> times = new LinkedList<String>();
	  LinkedList <String> UpdatedStations = new LinkedList<String>();
	  LinkedList <String> UpdatedTimes = new LinkedList<String>();
	  StringTokenizer full = new StringTokenizer(plannedSchedule);
	  StringTokenizer changes = new StringTokenizer(updates);
	  while(full.hasMoreTokens())
	  {
		  stations.add(full.nextToken());
		  times.add(full.nextToken());
	  }
	  while(changes.hasMoreTokens())
	  {
		  UpdatedStations.add(changes.nextToken());
		  UpdatedTimes.add(changes.nextToken());
	  }
	  for (int i = 0; i < UpdatedStations.size(); i++) {
		for (int j = 0; j < stations.size(); j++) {
			if(stations.get(j).equals(UpdatedStations.get(i)))
			{
				times.remove(j);
				times.add(j, UpdatedTimes.get(i));
			}
		}
	}
	for (int i = 0; i < stations.size(); i++) {
		result+=stations.get(i);
		result+=" ";
		result+=times.get(i);
		result+=" ";
	}
	
    return result.trim();
  }
}