java 数组字母排序
编写一个程序。将下列名称按字母顺序排列。GeorgeAlbertTinaXavierRogerTimWilliam...
编写一个程序。将下列名称按字母顺序排列。
George
Albert
Tina
Xavier
Roger
Tim
William 展开
George
Albert
Tina
Xavier
Roger
Tim
William 展开
展开全部
<html>
<head>
<title>字符串排序 </title>
</head>
<body>
<script type="text/javascript">
var name = new Array("George
", "Albert
", "Tina", "Xavier","Roger","Tim
","William");
document.write("排序前:" + name + "<br><br>");
for(n = 0; n < 7; n++) {
for(i = 1; i < 7; i++) {
if(name[n] > name[n+i]){ //JS的隐式类型转换，字符串之间比较大小根据它们所包含的字符依次比较大小，把字符转换成unicode编码即可。如a=97,A=65.
var stamp = name[n];
name[n] = name[n+i];
name[n+i] = stamp;
}
}
}
document.write("排序后:" + name);
</script>
</body>
</html>
<head>
<title>字符串排序 </title>
</head>
<body>
<script type="text/javascript">
var name = new Array("George
", "Albert
", "Tina", "Xavier","Roger","Tim
","William");
document.write("排序前:" + name + "<br><br>");
for(n = 0; n < 7; n++) {
for(i = 1; i < 7; i++) {
if(name[n] > name[n+i]){ //JS的隐式类型转换，字符串之间比较大小根据它们所包含的字符依次比较大小，把字符转换成unicode编码即可。如a=97,A=65.
var stamp = name[n];
name[n] = name[n+i];
name[n+i] = stamp;
}
}
}
document.write("排序后:" + name);
</script>
</body>
</html>
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
展开全部
import java.util.*;
public class StringSort
{
public static void main(String[] args)
{
String[] str = new String[7];
str[0] = new String("George");
str[1] = new String("Albert");
str[2] = new String("Tina");
str[3] = new String("Xavier");
str[4] = new String("Roger");
str[5] = new String("Tim");
str[6] = new String("William");
TreeSet treeSet = new TreeSet();
for (int i = 0; i < 7; i++) {
treeSet.add(str[i]);
}
Iterator it = treeSet.iterator();
while (it.hasNext()) {
System.out.println(it.next());
}
}
}
能排序 哈哈哈 不过底层是sun给解决了
public class StringSort
{
public static void main(String[] args)
{
String[] str = new String[7];
str[0] = new String("George");
str[1] = new String("Albert");
str[2] = new String("Tina");
str[3] = new String("Xavier");
str[4] = new String("Roger");
str[5] = new String("Tim");
str[6] = new String("William");
TreeSet treeSet = new TreeSet();
for (int i = 0; i < 7; i++) {
treeSet.add(str[i]);
}
Iterator it = treeSet.iterator();
while (it.hasNext()) {
System.out.println(it.next());
}
}
}
能排序 哈哈哈 不过底层是sun给解决了
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
展开全部
数组转换为List，然后调用Java中集合的Collections.sort(list)方法
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
展开全部
public class aaa {
public static void main(String []args){
String [] s = {"George",
"Albert",
"Tina",
"Xavier",
"Roger",
"Tim",
"William"};
String t;
for(int i = 0;i<7;i++){
for(int j=i;j<7;j++){
if(s[i].compareTo(s[j])>0){
t = s[i];
s[i]=s[j];
s[j]=t;
}
}
}
for(int i = 0; i < 7;i++)
System.out.println(s[i]);
}
}
public static void main(String []args){
String [] s = {"George",
"Albert",
"Tina",
"Xavier",
"Roger",
"Tim",
"William"};
String t;
for(int i = 0;i<7;i++){
for(int j=i;j<7;j++){
if(s[i].compareTo(s[j])>0){
t = s[i];
s[i]=s[j];
s[j]=t;
}
}
}
for(int i = 0; i < 7;i++)
System.out.println(s[i]);
}
}
本回答被提问者采纳
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
更多回答（2）
推荐律师服务：
若未解决您的问题，请您详细描述您的问题，通过百度律临进行免费专业咨询
