ProjectEuler/ProjectEulerJava
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulerjava.git synced 2025-12-07 01:23:56 -05:00
Code Issues Packages Projects Releases Wiki Activity

Updated for performance

Browse Source
This commit is contained in:
Mattrixwv
2020-06-17 14:08:08 -04:00
parent a8fe06b3e4
commit 8acb129f95
1 changed files with 10 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
src/main/java/mattrixwv/ProjectEuler/Problems/Problem22.java
View File

@@ -413,28 +413,33 @@ public class Problem22 extends Problem{
//Sort all the names
Collections.sort(names);
//Step through every name adding up the values of the characters
for(Integer nameCnt = 0;nameCnt < names.size();++nameCnt){
for(int nameCnt = 0;nameCnt < names.size();++nameCnt){
//Step through every character in the current name adding up the value of the characters
sums.add(0L);
for(Integer charCnt = 0;charCnt < names.get(nameCnt).length();++charCnt){
for(int charCnt = 0;charCnt < names.get(nameCnt).length();++charCnt){
//A = 65 so subtracting 64 means A - 1. This will only work correctly if all letters are capitalized
sums.set(nameCnt, sums.get(nameCnt) + names.get(nameCnt).charAt(charCnt) - 64);
}
}
//Get the product for all numbers
for(Integer cnt = 0;cnt < sums.size();++cnt){
for(int cnt = 0;cnt < sums.size();++cnt){
prod.add(sums.get(cnt) * (cnt + 1));
}
//Get the sum of all the numbers
long sum = Algorithms.getLongSum(prod);
System.out.println("sums last = " + sums.get(sums.size() - 4) + ", " + sums.get(sums.size() - 3) + ", " + sums.get(sums.size() - 2) + ", " + sums.get(sums.size() - 1));
System.out.println("prod last = " + prod.get(prod.size() - 4) + ", " + prod.get(prod.size() - 3) + ", " + prod.get(prod.size() - 2) + ", " + prod.get(prod.size() - 1));
//Stop the timer
timer.stop();
//Save the results
result = String.format("The answer to the question is %d\n", Algorithms.getLongSum(prod));
result = String.format("The answer to the question is %d\n", sum);
}
}
/* Results:
The answer to the question is 871198282
It took 17.822 milliseconds to solve this problem.
It took 935.700 microseconds to solve this problem.
*/