我目前有2个阵列,功率和能量:
int[] power = [20, 10, 50, 10, 30, 5];
powerIndex 0 1 2 3 4 5
int[] energy = [20, 5, 15, 3, 10, 30];
energyIndex 0 1 2 3 4 5
我想获得一个以幂数组的索引排序(从低到高)的数组,并且如果幂数相同,则使用较少能量的幂应该排在首位。所以基本上我想要的输出是:
int[] result = [5, 3, 1, 0, 4, 2]
到目前为止,这是我的代码:
int[] result = new int[power.length];
int answerIndex = 0;
int tempSmallest = Integer.MAX_VALUE;
int lastNumberSaved = 0;
int posWithSmallerPower = 0;
while (answerIndex < power.length) {
for (int i = 0; i < power.length; i++) {
int current = power[i];
if (tempSmallest > current && current > lastNumberSaved) {
tempSmallest = current;
posWithSmallerPower = i;
}
if (tempSmallest >= current && current > lastNumberSaved) {
if (current != lastNumberSaved && energy[posWithSmallerPower] > energy[i]) {
tempSmallest = current;
posWithSmallerPower = i;
}
}
}
answer[answerIndex] = posWithSmallerPower;
answerIndex++;
lastNumberSaved = tempSmallest;
tempSmallest = Integer.MAX_VALUE;
}
return answer;
我得到的是:[5、3、0、4、2、2]。 再说一次,我应该得到的是:[5、3、1、0、4、2]
我在处理具有相同数字的力量时遇到了麻烦。我确实通过能量比较了第二个数组中的它们,实际上我首先获得了索引3中的幂,但是随后代码完全忘记了第二个幂也具有相同的数字(10)。
我该如何实现?谢谢!
答案 0 :(得分:2)
这似乎是实现Comparable
接口的临时数据结构的一个好用例。 javadoc for Comparable
解释了如何很好地工作,但这是一个示例:
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.stream.Collectors;
public final class Main {
private static class Entry implements Comparable<Entry> {
private final int power;
private final int energy;
private final int index;
public Entry(int power, int energy, int index) {
this.power = power;
this.energy = energy;
this.index = index;
}
@Override
public int compareTo(Entry o) {
if (this.power != o.power) {
return this.power - o.power;
}
return this.energy - o.energy;
}
}
public static void main(String[] args) {
int[] power = {20, 10, 50, 10, 30, 5};
int[] energy = {20, 5, 15, 3, 10, 30};
List<Entry> entries = new ArrayList<>();
for (int i = 0; i < power.length; i++) {
entries.add(new Entry(power[i], energy[i], i));
}
Collections.sort(entries);
List<Integer> result = entries.stream()
.map(entry -> entry.index)
.collect(Collectors.toList());
System.out.println(result);
}
}
哪个输出:
[5, 3, 1, 0, 4, 2]
答案 1 :(得分:1)
在Comparator<T>
中使用内联list.sort()
来比较两个powerEnergyIndex。
import java.util.ArrayList;
import java.util.List;
public class MainApplication {
public static void main(String[] args) {
int[] power = {20, 10, 50, 10, 30, 5};
int[] energy = {20, 5, 15, 3, 10, 30};
List<PowerEnergyIndex> powerEnergyIndices = new ArrayList<>();
for(int i=0;i<power.length;i++) {
powerEnergyIndices.add(new PowerEnergyIndex(power[i],energy[i],i));
}
powerEnergyIndices.sort((p1, p2)-> {
if(p1.power!=p2.power) {
return p1.power-p2.power;
}
return p1.energy-p2.energy;
});
int[] result = powerEnergyIndices.stream()
.map(powerEnergyIndex -> powerEnergyIndex.index)
.mapToInt(x->x)
.toArray();
for(int i:result) {
System.out.print(i + " ");
}
}
static class PowerEnergyIndex {
private int power;
private int energy;
private int index;
public PowerEnergyIndex(final int power, final int energy, final int index) {
this.power = power;
this.energy = energy;
this.index = index;
}
}
}
输出
5 3 1 0 4 2