uva10905
来源:互联网 发布:598营销软件 编辑:程序博客网 时间:2024/05/19 13:09
import java.util.*;
public class Main{
public static void main(String [] args){
Scanner input = new Scanner(System.in);
String [] fun = new String [55];
int n = input.nextInt();
while(n != 0){
for(int i = 0; i < n; i++){
fun[i] = input.next();
for(int j = i; j > 0; j--){
if(maxx(fun[j],fun[j - 1])){
String temp = fun[j];
fun[j] = fun[j - 1];
fun[j - 1] = temp;
}
else
break;
}
}
for(int i = 0; i < n; i++)
System.out.print(fun[i]);
System.out.println();
n = input.nextInt();
}
}
public static boolean maxx(String a,String b){
if((a + b).compareTo((b + a)) > 0)
return true;
else
}
public class Main{
public static void main(String [] args){
Scanner input = new Scanner(System.in);
String [] fun = new String [55];
int n = input.nextInt();
while(n != 0){
for(int i = 0; i < n; i++){
fun[i] = input.next();
for(int j = i; j > 0; j--){
if(maxx(fun[j],fun[j - 1])){
String temp = fun[j];
fun[j] = fun[j - 1];
fun[j - 1] = temp;
}
else
break;
}
}
for(int i = 0; i < n; i++)
System.out.print(fun[i]);
System.out.println();
n = input.nextInt();
}
}
public static boolean maxx(String a,String b){
if((a + b).compareTo((b + a)) > 0)
return true;
else
return false;
//123 1234 1234>123
}}
0 0
- uva10905
- UVA10905
- uva10905
- uva10905
- Uva10905
- UVA10905
- uva10905
- uva10905
- uva10905
- uva10905
- uva10905
- UVa10905
- uva10905 - Children's Game
- Uva10905 Children's Game
- uva10905-Children's Game
- UVA10905- Children's Game
- UVA10905 - Children's Game
- UVA10905孩子们的游戏
- 你不知道的Bundle
- [汇编语言学习笔记][第四章第一个程序的编写]
- SolrCloud原理介绍 [
- wex简介
- 1013
- uva10905
- 怎样让浏览器变身代码编辑器?
- 深搜算法-1011
- 安卓、第三方分享功能代码;
- 关于扩展Josephus问题
- 基于stm32CubeMX和keil5的stm32f103学习编程
- JSON转javabean(pojo)利器
- leetcode258-Add Digits(非负整数各位相加)
- 如何显示隐藏Mac上的隐藏文件