Skip to content

Gruppe 1 #37

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wkschrll wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Gruppe 1 #37

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
45 changes: 24 additions & 21 deletions src/main/java/de/cas/mse/exercise/SumDigPower.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,37 +5,40 @@

public class SumDigPower {

public List<Long> sumDigPow(long a, long b) {
public List<Long> findEurekas(long intervalStart, long intervalEnd) {

List<Long> result = new ArrayList<Long>();
List<Long> eurekas = new ArrayList<Long>();

for (long i = a; i < b; i++) {
for (long number = intervalStart; number < intervalEnd; number++) {

List<Long> longs = new ArrayList<Long>();
List<Long> digits = extractDigits(Long.toString(number));

String temp = Long.toString(i);
long sum = sumDigitsPower(digits);

// Split values
for (int j = 0; j < temp.length(); j++) {
longs.add(Long.valueOf(temp.substring(j, j + 1)));
}

// Create sum
long sum = 0;
for (int j = 1; j <= longs.size(); j++) {
sum += Math.pow(longs.get(j - 1), j);
}

// Test if sum is equal
if (sum == i) {
result.add(sum);
if (sum == number) {
eurekas.add(sum);
}

}

System.out.println(result);
return result;
System.out.println(eurekas);
return eurekas;

}

private List<Long> extractDigits(String number) {
List<Long> digits = new ArrayList<Long>();
for (int digitIndex = 0; digitIndex < number.length(); digitIndex++) {
digits.add(Long.valueOf(number.substring(digitIndex, digitIndex + 1)));
}
return digits;
}

private long sumDigitsPower(List<Long> digits) {
long sum = 0;
for (int digitIndex = 0; digitIndex < digits.size(); digitIndex++) {
sum += Math.pow(digits.get(digitIndex), digitIndex + 1);
}
return sum;
}
}
10 changes: 5 additions & 5 deletions src/test/java/de/cas/mse/exercise/TestSumDigPower.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,26 +16,26 @@ public void setup() {

@Test
public void tenTo150_contains89and135() {
assertThat(sumDigPower.sumDigPow(10, 150)).containsExactly(89l, 135l);
assertThat(sumDigPower.findEurekas(10, 150)).containsExactly(89l, 135l);
}

@Test
public void ninetyTo100_isEmpty() {
assertThat(sumDigPower.sumDigPow(90, 100)).isEmpty();
assertThat(sumDigPower.findEurekas(90, 100)).isEmpty();
}

@Test
public void zeroTo100_firstTenNumbersAnd89ShoudBeContained() {
assertThat(sumDigPower.sumDigPow(1, 100)).containsExactly(1l, 2l, 3l, 4l, 5l, 6l, 7l, 8l, 9l, 89l);
assertThat(sumDigPower.findEurekas(1, 100)).containsExactly(1l, 2l, 3l, 4l, 5l, 6l, 7l, 8l, 9l, 89l);
}

@Test
public void tenTo100_only89Contained() {
assertThat(sumDigPower.sumDigPow(10, 100)).containsExactly(89l);
assertThat(sumDigPower.findEurekas(10, 100)).containsExactly(89l);
}

@Test
public void firstTenNumbers_shouldBeAllContained() {
assertThat(sumDigPower.sumDigPow(1, 10)).containsExactly(1l, 2l, 3l, 4l, 5l, 6l, 7l, 8l, 9l);
assertThat(sumDigPower.findEurekas(1, 10)).containsExactly(1l, 2l, 3l, 4l, 5l, 6l, 7l, 8l, 9l);
}
}