java常用算法之两个有序list的合并

/**
* 两个已顺序排序数组的合并
*
* @param aList
* @param bList
* @return
*/
public static List<Integer> mergeTwoSortList(List<Integer> aList,
List<Integer> bList) {
int aLength = aList.size(), bLength = bList.size();
List<Integer> mergeList = new ArrayList();
int i = 0, j = 0;
while (aLength > i && bLength > j) {
if (aList.get(i) > bList.get(j)) {
mergeList.add(i + j, bList.get(j));
j++;
} else {
mergeList.add(i + j, aList.get(i));
i++;
}
}
// blist元素已排好序， alist还有剩余元素
while (aLength > i) {
mergeList.add(i + j, aList.get(i));
i++;
}
// alist元素已排好序， blist还有剩余元素
while (bLength > j) {
mergeList.add(i + j, bList.get(j));
j++;
}
return mergeList;

}

public static void main(String[] args) {
List<Integer> aList = new ArrayList();
aList.add(3);
aList.add(6);
aList.add(7);
aList.add(10);
aList.add(13);
List<Integer> bList = new ArrayList();
bList.add(1);
bList.add(2);
bList.add(5);
bList.add(12);
bList.add(15);
bList.add(20);
bList.add(21);
List<Integer> mergeList = mergeTwoSortList(aList, bList);

System.err.println(mergeList.toString());
}

输出结果如下：

[1, 2, 3, 5, 6, 7, 10, 12, 13, 15, 16, 17, 20, 21, 22]