phaniram · December 28, 2011 18:31 · phaniram · Dec 29, 2011
diff --git a/Topfive.java b/Topfive.java
 import java.io.File;
 import java.io.FileNotFoundException;
 import java.io.FileReader;
 import java.util.Comparator;
 import java.util.HashMap;
 import java.util.Map;
 import java.util.Scanner;
 import java.util.TreeMap;

 class Topfive {

 	private HashMap<String, Integer> hashmap = new HashMap<String, Integer>();

 	public HashMap<String, Integer> getHashmap() {
 		return hashmap;
 	}

 	public void putWord(String main) {
 		Integer frequency = getHashmap().get(main);
 		if (frequency == null) {
 			frequency = 0;
 		}
 		hashmap.put(main, frequency + 1);
 	}

 	public TreeMap<String, Integer> process(File fFile)
 			throws FileNotFoundException {
 		Scanner scanner = new Scanner(new FileReader(fFile));
 		while (scanner.hasNextLine()) {
 			String wordp = scanner.nextLine();
 			int j = wordp.indexOf("query=") + 6;
 			int k = wordp.length() - 1;
 			String fut = wordp.substring(j, k).trim();
 			this.putWord(fut);
 		}
 		scanner.close();
 		ValueComparator bvc = new ValueComparator(getHashmap());
 		TreeMap<String, Integer> sorted_map = new TreeMap<String, Integer>(bvc);
 		sorted_map.putAll(getHashmap());
 		return sorted_map;
 	}

 	public static void main(String[] args) {
 		if (args.length == 0) {
 			File fFile = new File("D:\\a.in");
 			Topfive topfive = new Topfive();
 			try {
 				TreeMap<String, Integer> sorted_map = topfive.process(fFile);
 				int count = 0;
 				for (String key : sorted_map.keySet()) {
 					System.out.println(key);
 					count++;
 					if (count >= 5) {
 						break;
 					}
 				}
 			} catch (FileNotFoundException e) {
 				e.printStackTrace();
 			}
 		}
 	}
 }

 class ValueComparator implements Comparator<Object> {

 	private Map<String, Integer> base;

 	public ValueComparator(Map<String, Integer> base) {
 		this.base = base;
 	}
 	
 	@Override
 	public int compare(Object first_obj, Object second_obj) {
 		int ret = -1;
 		if (base.get(first_obj) < base.get(second_obj)) {
 			ret = 1;
 		}
 		return ret;
 	}
 }
	import java.io.File;
	import java.io.FileNotFoundException;
	import java.io.FileReader;
	import java.util.Comparator;
	import java.util.HashMap;
	import java.util.Map;
	import java.util.Scanner;
	import java.util.TreeMap;

	class Topfive {

	private HashMap<String, Integer> hashmap = new HashMap<String, Integer>();

	public HashMap<String, Integer> getHashmap() {
	return hashmap;
	}

	public void putWord(String main) {
	Integer frequency = getHashmap().get(main);
	if (frequency == null) {
	frequency = 0;
	}
	hashmap.put(main, frequency + 1);
	}

	public TreeMap<String, Integer> process(File fFile)
	throws FileNotFoundException {
	Scanner scanner = new Scanner(new FileReader(fFile));
	while (scanner.hasNextLine()) {
	String wordp = scanner.nextLine();
	int j = wordp.indexOf("query=") + 6;
	int k = wordp.length() - 1;
	String fut = wordp.substring(j, k).trim();
	this.putWord(fut);
	}
	scanner.close();
	ValueComparator bvc = new ValueComparator(getHashmap());
	TreeMap<String, Integer> sorted_map = new TreeMap<String, Integer>(bvc);
	sorted_map.putAll(getHashmap());
	return sorted_map;
	}

	public static void main(String[] args) {
	if (args.length == 0) {
	File fFile = new File("D:\\a.in");
	Topfive topfive = new Topfive();
	try {
	TreeMap<String, Integer> sorted_map = topfive.process(fFile);
	int count = 0;
	for (String key : sorted_map.keySet()) {
	System.out.println(key);
	count++;
	if (count >= 5) {
	break;
	}
	}
	} catch (FileNotFoundException e) {
	e.printStackTrace();
	}
	}
	}
	}

	class ValueComparator implements Comparator<Object> {

	private Map<String, Integer> base;

	public ValueComparator(Map<String, Integer> base) {
	this.base = base;
	}

	@Override
	public int compare(Object first_obj, Object second_obj) {
	int ret = -1;
	if (base.get(first_obj) < base.get(second_obj)) {
	ret = 1;
	}
	return ret;
	}
	}