TreeMap Program
TreeMap Program
fresco;
import java.util.*;
import java.lang.System.*;
import java.lang.*;
TreeMap<Integer,String> list =
createPlayerPositionMap(cricketarray[f]);
TreeMap<String,Integer> list1 =createPlayerScoreMap(cricketarray[f]);
// System.out.println(list);
// System.out.println(list1);
// System.out.println(list.get(1));
// System.out.println(list1.get(list.get(1)));
if(cricket.containsKey(list.get(1)))
{
max = cricket.get(list.get(1)) + list1.get(list.get(1));
cricket.replace(list.get(1),max);
if(cricketdetails.containsKey(list.get(1)))
{
count++;
}
cricketdetails.put(list.get(1),new TreemapHandson(count,max));
}
else
{ count++;
cricket.put(list.get(1), list1.get(list.get(1)));
cricketdetails.put(list.get(1),new
TreemapHandson(count,list1.get(list.get(1))));
}
return cricketdetails;
}
public String getQuery(String cricketDataset, String query) {
String resultoutput = "";
if(query.equals("3"))
{
//System.out.println("HI");
TreeMap<String,TreemapHandson> crickdetails =
createMatchesMap(cricketDataset);
//System.out.println(crickdetails);
int max = 0;
for(Map.Entry<?, ?> entry: crickdetails.entrySet()) {
//System.out.println(crickdetails.get(entry.getKey()).score);
//System.out.println(crickdetails.get(entry.getKey()).noofmatches);
if(crickdetails.get(entry.getKey()).score > max)
{
max = crickdetails.get(entry.getKey()).score;
}
}
Set<String> set1 = crickdetails.keySet();
for(String key : set1)
{
if(crickdetails.get(key).score == max)
{
resultoutput = resultoutput + "The Efficient Opener is "+ key;
}
}
return resultoutput;
}
String [] threshold = query.split(" ");
TreeMap<Integer,String> listofPlayers =
createPlayerPositionMap(cricketDataset);
TreeMap<String,Integer> playersscore =
createPlayerScoreMap(cricketDataset);
if(threshold[0].equals("1"))
{ resultoutput = "";
String [] startend = query.split(" ");
return null;
}
}