ResultSet记录集里面的内容如何实现按照某个字段排序?? 你向PreparedStatement中发送sql语句的时候就应该加入"order by"子句,使返回的结果按照字段排序 解决方案 » 免费领取超大流量手机卡,每月29元包185G流量+100分钟通话, 中国电信官方发货 可以把得到的ResultSet放到arrays里面,让后实现Comparator接口,写你希望排序成什么的代码,在从里面取你的记录集. To:kofwr(搭补流二)能否具体点,最好给个例子,谢谢! 例子?你参考TIJ中讲Collection的章节,里面和这个大同小异.. 建议rion10()去卖B!!!>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>庆祝您老卖B成功! 对一个数组进行排序 public static void qsort(Object arr[], boolean asc) { if(arr == null || arr.length < 2) { return; } else { qsort(arr, 0, arr.length - 1, asc, ((Comparer) (new DefaultComparer()))); return; } } public static void qsort(Object arr[], int lo0, int hi0, boolean asc, Comparer comp) { if(lo0 >= hi0) return; int lo = lo0; int hi = hi0; int less = asc ? -1 : 1; int greater = asc ? 1 : -1; int mid = (lo + hi) / 2; Object t = arr[mid]; arr[mid] = arr[lo0]; arr[lo0] = t; while(lo < hi) { for(int rc = comp.compare(arr[lo], arr[lo0]); lo < hi0 && (rc == 0 || rc / Math.abs(rc) == less); rc = comp.compare(arr[lo], arr[lo0])) lo++; for(int rc = comp.compare(arr[hi], arr[lo0]); rc != 0 && rc == Math.abs(rc) * greater; rc = comp.compare(arr[hi], arr[lo0])) hi--; if(lo < hi) { t = arr[lo]; arr[lo] = arr[hi]; arr[hi] = t; } } t = arr[lo0]; arr[lo0] = arr[hi]; arr[hi] = t; qsort(arr, lo0, hi - 1, asc, comp); qsort(arr, hi + 1, hi0, asc, comp); } javac 请问JVM是哪种语言写的?谢谢! 请教那一种软件能够打包出这样的exe文件补丁 Java如何把数组打印到txt文件里面? class Test为何算不出来110的4到7位为0? java Runtime 子进程停滞 列表框选择问题 _ 为什么选一下,反应两次,如何才能做到只反应一次? 记录集操作,在线等! byte数组与String转换的问题 jsp 点击链接 弹出另存为对话框 一个小问题,请大侠指点,立即给分!!! 高分求Robocode资料
能否具体点,最好给个例子,谢谢!
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
庆祝您老卖B成功
!
public static void qsort(Object arr[], boolean asc)
{
if(arr == null || arr.length < 2)
{
return;
} else
{
qsort(arr, 0, arr.length - 1, asc, ((Comparer) (new DefaultComparer())));
return;
}
} public static void qsort(Object arr[], int lo0, int hi0, boolean asc, Comparer comp)
{
if(lo0 >= hi0)
return;
int lo = lo0;
int hi = hi0;
int less = asc ? -1 : 1;
int greater = asc ? 1 : -1;
int mid = (lo + hi) / 2;
Object t = arr[mid];
arr[mid] = arr[lo0];
arr[lo0] = t;
while(lo < hi)
{
for(int rc = comp.compare(arr[lo], arr[lo0]); lo < hi0 && (rc == 0 || rc / Math.abs(rc) == less); rc = comp.compare(arr[lo], arr[lo0]))
lo++; for(int rc = comp.compare(arr[hi], arr[lo0]); rc != 0 && rc == Math.abs(rc) * greater; rc = comp.compare(arr[hi], arr[lo0]))
hi--; if(lo < hi)
{
t = arr[lo];
arr[lo] = arr[hi];
arr[hi] = t;
}
}
t = arr[lo0];
arr[lo0] = arr[hi];
arr[hi] = t;
qsort(arr, lo0, hi - 1, asc, comp);
qsort(arr, hi + 1, hi0, asc, comp);
}