单词冒泡排序算法
来源:互联网 发布:php xss攻击过滤处理 编辑:程序博客网 时间:2024/05/18 01:39
测试单词序列:cusmattribute5:applydate:hostserialno:productcode:clearbrno:banksystype:brno:tellerno:
terminalno:accbrno:bankdate:bankid:banktime:bankstatus:bankdealcode:bankdealmsg:
draccbrnolist:craccbrnolist:dracnolist:cracnolist:accamount:accamount1:accamount2:
accamount3:acctid:flowtype:workdate:agentserialno:tradestep:origapplydate:orighostserialno:
origbankdate:origbankid:crtdatetime:altdatetime:prduattribute1:prduattribute2:prduattribute3:
prduattribute4:prduattribute5:checkresult:cusmattribute1:cusmattribute2:cusmattribute3:
cusmattribute4:
排序后序列:
accamount1:accamount2:accamount3:accamount:accbrno:acctid:agentserialno:altdatetime:
applydate:bankdate:bankdealcode:bankdealmsg:bankid:bankstatus:banksystype:banktime:
brno:checkresult:clearbrno:craccbrnolist:cracnolist:crtdatetime:cusmattribute1:cusmattribute2:
cusmattribute3:cusmattribute4:cusmattribute5:draccbrnolist:dracnolist:flowtype:hostserialno:
origapplydate:origbankdate:origbankid:orighostserialno:prduattribute1:prduattribute2:
prduattribute3:prduattribute4:prduattribute5:productcode:tellerno:terminalno:tradestep:
workdate:
算法源码
private static String[] sort(String[] strarr) {for (int i = 0; i < strarr.length; i++) {for (int j = strarr.length - 1; j > i; j--) {exchange(strarr, j, 0, 'd');}}return strarr;}private static void exchange(String[] arr, int j, int level, char desc) {if (!arr[j].equals(arr[j - 1])) {String tmp;char cur = 0;char pre = 0;if (level < arr[j].length()) {cur = arr[j].charAt(level);} else {cur = arr[j].charAt(arr[j].length() - 1);}if (level < arr[j - 1].length()) {pre = arr[j - 1].charAt(level);} else {pre = arr[j - 1].charAt(arr[j - 1].length() - 1);}switch (desc) {case 'd':if (cur < pre) {tmp = arr[j];arr[j] = arr[j - 1];arr[j - 1] = tmp;} else if (cur == pre) {exchange(arr, j, ++level, desc);}break;case 'a':if (cur > pre) {tmp = arr[j];arr[j] = arr[j - 1];arr[j - 1] = tmp;} else if (cur == pre) {exchange(arr, j, ++level, desc);}break;}}}
String[] s = sb.toString().split(":");for (int j = 0; j < s.length; j++) {System.out.println(s[j]);}
- 单词冒泡排序算法
- 排序算法--冒泡排序
- 排序算法-冒泡排序
- 排序算法--冒泡排序
- 排序算法--冒泡排序
- 排序算法-冒泡排序
- 排序算法 冒泡排序
- 排序算法-- 冒泡排序
- 排序算法-冒泡排序
- 排序算法---冒泡排序
- 排序算法-冒泡排序
- 排序算法--冒泡排序
- 排序算法--冒泡排序
- 排序算法--冒泡排序
- 排序算法--冒泡排序
- 排序算法--冒泡排序
- 排序算法--冒泡排序
- 排序算法 冒泡排序
- linux select I/O共享服务端
- Linux下rz,sz与ssh的配合使用
- Hdu 1171 Big Event in HDU
- 位图排序算法
- sql 修改 字段内的
- 单词冒泡排序算法
- 淡淡的微笑,静悄悄地过
- Flex使用cookie
- 在cxf web service类中同时注入spring bean出错时的解决办法
- XML的约两种约束——DTD、Schema
- Android上传log信息到服务器
- flex datagrid(表格) 加一列复选框
- select read write
- socket send 和 recv详解