dnasorting.java

来自「PKU中一些数据结构基本算法题的java实现」· Java 代码 · 共 61 行

import java.util.*;


/**
 * ID:1007
 * @author yhm
 *
 */
public class DNASorting {

	static int len;
	static int num;
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		len = cin.nextInt();
		num =  cin.nextInt();
		DNASortingNode[] array = new DNASortingNode[num];
		for(int i=0;i<num;i++){
			String str = cin.next();
			int count = getCount(str);
			array[i] = new DNASortingNode(str,count); 		
		}
		
		Arrays.sort(array);
		for(int i=0;i<num;i++){
			System.out.println(array[i].str);
		}
		
	}
	
	static int getCount(String str){
		int sum = 0;
		for(int i=0;i<len;i++){
			for(int j=i+1;j<len;j++){
				if(str.charAt(i)>str.charAt(j)){
					sum++;
				}
			}
		}
		return sum;
	}

}

class DNASortingNode implements Comparable<DNASortingNode>{
	public int compareTo(DNASortingNode o) {
		return count.compareTo(o.count);
	}
	String str;
	Integer count;
	public DNASortingNode(String str, int count) {
		super();
		this.str = str;
		this.count = count;
	}
	
}