限定个数的APP添加程序

最新推荐文章于 2024-01-11 14:48:50 发布

原创最新推荐文章于 2024-01-11 14:48:50 发布 · 640 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Java #限定个数排序

排序同时被 2 个专栏收录

1 篇文章

订阅专栏

分类

0 篇文章

订阅专栏

本文介绍了一种用于维护固定大小且按特定属性排序的结果列表的算法。该算法能够在不破坏原有顺序的情况下插入新元素，并确保列表长度不超过预设的最大值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

private static void addResultElments(List<resultBean> resultList, resultBean rBean) {
if (resultList.size() == 0) {
resultList.add(rBean);
}else if (resultList.size() > 0 && resultList.size() < resultMount) {
int addFlag = 0;
for (int i = resultList.size() - 1; i > -1; i--) {
if (rBean.getProperty() <= resultList.get(i).getProperty()) {
addFlag = 1;
resultBean tempResultBean = resultList.get(resultList.size() -1);
for (int j = resultList.size() -2; j > i; j--) {
resultList.set(j+1, resultList.get(j));
}
if (resultList.size() > i+1) {
resultList.set(i+1, rBean);
resultList.add(tempResultBean);
}else {
resultList.add(rBean);
}

break;
}
}
if (addFlag == 0) {
resultBean tempBean = resultList.get(resultList.size() - 1);
for (int i = resultList.size() - 2; i > -1; i--) {
resultList.set(i+1, resultList.get(i));
}
resultList.set(0, rBean);
resultList.add(tempBean);
}
}else {
int addFlag = 0;
for (int i = resultList.size() - 1; i > -1; i--) {
if (rBean.getProperty() <= resultList.get(i).getProperty()) {
addFlag = 1;
for (int j = resultList.size() -2; j > i; j--) {
resultList.set(j+1, resultList.get(j));
}
if (resultList.size() > i+1) {
resultList.set(i+1, rBean);
}else {
resultList.add(rBean);
}

break;
}
}
if (addFlag == 0) {
for (int i = resultList.size() - 2; i > -1; i--) {
resultList.set(i+1, resultList.get(i));
}
resultList.set(0, rBean);
}else if (addFlag == 1 && resultList.size() > resultMount) {
resultList.remove(resultList.size() -1);
}
}
}