Algorithm: POJ1007 DNA sorting

This problem is relatively simple, the focus should be on how to reduce the number of cycles.

 Packagepractice;ImportJava.io.BufferedInputStream;ImportJava.util.Map;ImportJava.util.Scanner;ImportJava.util.TreeMap;/*** DNA Sorting * *@authorCaiyu * @date 2014-11-5*/ Public classPOJ1007 { Public Static voidMain (string[] args) {Scanner cin=NewScanner (NewBufferedinputstream (system.in)); intL =Cin.nextint (); intt =Cin.nextint ();        String s; Map<integer, string> m =NewTreemap<integer, string>();  for(inti = 0; I < T; i++) {s=Cin.next (); int[] Count =New int[L]; intInversion = 0;  for(intj = 0, len = l-1; J < Len; J + +) {Count[j]=S.charat (j);  for(inth = 0; H < J; h++) {                    if(Count[h] >Count[j]) inversion++;        }} m.put (inversion, s); }         for(String x:m.values ()) {System.out.println (x); }    }}

Algorithm: POJ1007 DNA sorting