给定如下数组:
String[] ls={"A","B","C","V","G","H","K"};
String[] ses={"B","G","K"};
要求参照数组ses中的字母顺序对数组ls进行优先排序,对没有在ses数组中出现的字母排在数组的最后,不用排序,最后输出排好顺序的数组ls.
String[] ls={"A","B","C","V","G","H","K"};
String[] ses={"B","G","K"};
要求参照数组ses中的字母顺序对数组ls进行优先排序,对没有在ses数组中出现的字母排在数组的最后,不用排序,最后输出排好顺序的数组ls.
解决方案 »
- 怎么为ant中的junit配制需要的xml文件?
- 大家帮下忙。。。看看计算器这样写为什么不能运行啊?
- 我用mysql不知道时间怎么设置的. java获取的时候
- 请问System.setProperty(,) 是否支持相对路径?
- JBuilder 2006 里面快速导入包的快捷键
- 控制未登录用户跳转到登陆界面 急在线等
- ----Class.forName-----报错
- 关于Oracle BLOB类型,一个String字符怎么写入BLOB字段?
- 请问ldap-3.3-3.src.rpm包怎样安装?(在线等候)
- 我想学java,朋友们帮帮忙
- 求教 关于++的问题?
- java 中Code Points and Code Units 的区别?
package test;public class Test1 { static String[] ls={"A","B","C","V","G","H","K"};
static String[] ses={"B","G","K"}; /**
* @param args
*/
public static void main(String[] args) { int indexSes = 0;
int indexLs = 0;
while (indexSes <= ses.length - 1) {
while (true) {
int indexTemp = search(ses[indexSes], indexLs);
if (indexTemp != -1 && indexTemp != indexLs) {
String tempS = ls[indexLs];
ls[indexLs] = ls[indexTemp];
ls[indexTemp] = tempS;
}
if (indexTemp != -1)
indexLs++;
else
break;
} indexSes++;
}
for (String string : ls) {
System.out.print(string + " ");
} } private static int search(String c, int startIndex) {
for (int i = startIndex; i <= ls.length - 1; i++) {
if (ls[i].equals(c))
return i;
}
return -1;
}}对不对的lz再看下哈