Skip to content

Artemis: Refactor and Optimize Methods in the Double Class #35

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
mike-turintech wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Artemis: Refactor and Optimize Methods in the Double Class #35

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
40 changes: 15 additions & 25 deletions app/src/main/java/control/Double.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,11 +10,7 @@ public class Double {
public static int sumSquare(int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) {
sum = sum + i * j;
}
}
sum = sum + i * i;
}
return sum;
}
Expand All @@ -27,10 +23,8 @@ public static int sumSquare(int n) {
*/
public static int sumTriangle(int n) {
int sum = 0;
for (int i = 0; i < n + 1; i++) {
for (int j = 0; j < i; j++) {
sum = sum + j;
}
for (int i = 1; i <= n; i++) {
sum += i * (i + 1) / 2;
}
return sum;
}
Expand All @@ -44,19 +38,17 @@ public static int sumTriangle(int n) {
* @return The number of pairs in the array.
*/
public static int countPairs(int[] arr) {
int count = 0;
for (int i = 0; i < arr.length; i++) {
int nDuplicates = 0;
for (int j = 0; j < arr.length; j++) {
if (arr[i] == arr[j]) {
nDuplicates++;
}
}
if (nDuplicates == 2) {
count++;
java.util.Map<Integer, Integer> counts = new java.util.HashMap<>();
for (int num : arr) {
counts.put(num, counts.getOrDefault(num, 0) + 1);
}
int pairCount = 0;
for (int count : counts.values()) {
if (count == 2) {
pairCount++;
}
}
return count / 2;
return pairCount;
}

/**
Expand All @@ -70,10 +62,8 @@ public static int countPairs(int[] arr) {
public static int countDuplicates(int[] arr0, int[] arr1) {
int count = 0;
for (int i = 0; i < arr0.length; i++) {
for (int j = 0; j < arr1.length; j++) {
if (i == j && arr0[i] == arr1[j]) {
count++;
}
if (i < arr1.length && arr0[i] == arr1[i]) {
count++;
}
}
return count;
Expand All @@ -97,4 +87,4 @@ public static int sumMatrix(int[][] arr) {
}
return sum;
}
}
}