RoboterFabrik/Roboter/tpe/exceptions/roboter/R2D2.java

94 lines
1.9 KiB
Java
Raw Normal View History

2022-12-27 11:09:41 +01:00
package tpe.exceptions.roboter;
import java.util.*;
2023-01-07 14:15:53 +01:00
import tpe.exceptions.RobotException;
2022-12-27 11:09:41 +01:00
public class R2D2 implements Robot {
RobotException robotexception;
2022-12-28 12:22:05 +01:00
private String name;
private boolean powerSwitch;
private int id;
StringBuilder sb = new StringBuilder();
2022-12-28 12:22:05 +01:00
public R2D2(String name, boolean powerSwitch) {
super();
id = createId();
2022-12-28 12:22:05 +01:00
this.name = name;
this.powerSwitch = powerSwitch;
}
private int createId() {
Random randomID = new Random();
return randomID.nextInt(10000);
}
2022-12-27 11:09:41 +01:00
@Override
public int getId() {
2022-12-28 12:22:05 +01:00
return id;
2022-12-27 11:09:41 +01:00
}
@Override
public String getName() {
2022-12-28 12:22:05 +01:00
return name;
2022-12-27 11:09:41 +01:00
}
@Override
public void triggerPowerSwitch() {
2022-12-28 12:22:05 +01:00
if(powerSwitch=false)
powerSwitch=true;
else
powerSwitch=false;
2022-12-27 11:09:41 +01:00
}
@Override
public boolean isPowerOn() {
2022-12-28 12:22:05 +01:00
return powerSwitch;
2022-12-27 11:09:41 +01:00
}
@Override
public RobotException getLastException() {
// TODO Auto-generated method stub
return null;
}
@Override
public String speak(int[] zahlen) throws RobotException {
for (int i = 0; i < zahlen.length; i++) {
sb.append(zahlen[i]);
if (i < zahlen.length - 1) {
sb.append(", ");
}
}
String output = sb.toString();
return output;
2022-12-27 11:09:41 +01:00
}
@Override
public int[] think(int[] zahlen) throws RobotException {
for(int i = 0; i < zahlen.length; i++) {
if(zahlen[i]==42)
throw new RobotException.MagicValueException();
}
2022-12-28 12:22:05 +01:00
// Iterate through zahlen from left to right
for (int i = 0; i < zahlen.length - 1; i++) {
// Set the index of the current smallest element to i
int minIndex = i;
// Search the smallest element in zahlen
for (int j = i + 1; j < zahlen.length; j++) {
if (zahlen[j] < zahlen[minIndex]) {
minIndex = j;
}
}
// Switch the smallest with the current element
int temp = zahlen[i];
zahlen[i] = zahlen[minIndex];
zahlen[minIndex] = temp;
}
return zahlen;
2022-12-27 11:09:41 +01:00
}
2022-12-27 11:09:41 +01:00
}