

Moderator: Algorithmen und Datenstrukturen
Code: Alles auswählen
if (getComp().compare(list.getListElem(i),elem.getElem())== 0) {
return i;
}
Dieser Fehler kommt bei der for-Schleife vor.might not have been initialized
Code: Alles auswählen
{
T max;
T secMax;
if(getListLength() < 2) {return -1;}
T first = getListElem(0);
T second = getListElem(1);
if(getComp().compare(first, second) > 0) {
max = first;
secMax = second;
setLargest(0);
setSecLargest(1);
}
else if(getComp().compare(first, second) < 0){
max = second;
secMax = first;
setLargest(1);
setSecLargest(0);
}
else {
for(int i=2; i< getListLength(); i++) {
T elem = getListElem(i);
if(elem == null){continue ; }
else {
if(getComp().compare(elem, max) > 0){
secMax = max;
setSecLargest(getSecLargest());
max = elem;
setLargest(getLargest());
}
if(getComp().compare(elem, secMax) > 0){
secMax = elem;
setSecLargest(getSecLargest());
}
}
}
}
return getSecLargest();
}
Code: Alles auswählen
{
T max;
T secMax;
if(getListLength() < 2) {return -1;}
T first = getListElem(0);
T second = getListElem(1);
if(getComp().compare(first, second) > 0) {
max = first;
secMax = second;
setLargest(0);
setSecLargest(1);
}
if(getComp().compare(first, second) < 0){
max = second;
secMax = first;
setLargest(1);
setSecLargest(0);
}
for(int i=2; i< getListLength(); i++) {
T elem = getListElem(i);
if(elem == null){continue ; }
if(getComp().compare(elem, max) > 0){
secMax = max;
setSecLargest(getSecLargest());
max = elem;
setLargest(getLargest());
}
else if (getComp().compare(elem, secMax) > 0){
secMax = elem;
setSecLargest(getSecLargest());
}
}
return getSecLargest();
}