POJ 1007
2014-05-27 22:29
155 查看
import java.util.Scanner; public class poj1007 { /** * @param args */ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int charNumber = sc.nextInt(); int rowNumber = sc.nextInt(); String[] content = new String[rowNumber]; Integer[] sorted = new Integer[rowNumber]; //Integer[] sorted_copy = new Integer[rowNumber]; for(int i=0;i<rowNumber;i++){ int currSorted = 0; String tmp = sc.next(); content[i]=tmp; char[] ch = tmp.toCharArray(); for(int j=0;j<charNumber-1;j++){ for(int k=j+1;k<charNumber;k++){ if(ch[j]>ch[k]){ currSorted++; } } } sorted[i]=currSorted; //sorted_copy[i]=currSorted; } for(int i=0;i<rowNumber-1;i++){ for(int j=i+1;j<rowNumber;j++){ if(sorted[i]>sorted[j]){ int itmp = sorted[i]; sorted[i] = sorted[j]; sorted[j] = itmp; String tmp = content[i]; content[i] = content[j]; content[j] = tmp; } } } for(int i=0;i<rowNumber;i++){ System.out.println(content[i]); } } }
相关文章推荐
- POJ-1007
- POJ 1007-DNA Sorting
- POJ 1007
- poj1007 DNA Sorting
- POJ 题目1007 DNA Sorting (水题 排序)
- STL 应用2 POJ 1007 DNA Sorting 题解 (STL完美解答)
- [滴水石穿]poj 1007-DNA Sorting 结题报告【1】
- poj 1007 DNA Sorting
- poj-1007 DNA sorting
- POJ-1007-DNA_Sorting
- poj1007/1008/1013
- poj 1007 dna逆序数
- poj 1007 逆序问题
- POJ 1007 DNA Sorting
- POJ 1007
- 【POJ】1007 DNA Sorting
- poj 1007 DNA Sorting
- POJ 1007: DNA Sorting
- STL 应用2 POJ 1007 DNA Sorting 题解 (STL完美解答)
- (POJ 1007)DNA Sorting