CCF_100/ASDV-Java
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

MyStack

Browse Source
This commit is contained in:
Chloe Fontenot 🏳️‍⚧️
2023-02-07 12:59:49 -06:00
parent f5c3a529cd
commit 2763b912e3
4 changed files with 179 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
Semester 2/Assignments/MP2_CalebFontenot/src/main/java/com/calebfontenot/mp2_calebfontenot/Circle2D.java
View File

@@ -211,25 +211,28 @@ public class Circle2D {
int idealCount = 0;
int actualCount = 0;
int arrayIndex = 0;
for (int i = 0; i < oldArray.length; ++i) {
actualCount = 0;
for (int j = 0; j < oldArray.length; ++j) {
boolean doesOverlap = oldArray[i].overlaps(oldArray[j]);
if (doesOverlap) {
++actualCount;
int arrayIndex2 = 0;
for (int arrayIndex = 0; arrayIndex < oldArray.length; ++arrayIndex) {
for (int i = 0; i < oldArray.length; ++i) {
actualCount = 0;
for (int j = 0; j < oldArray.length; ++j) {
boolean doesOverlap = oldArray[i].overlaps(oldArray[j]);
if (doesOverlap) {
++actualCount;
}
}
if (actualCount == idealCount) {
array[arrayIndex2] = oldArray[i];
System.out.println(oldArray[i]);
arrayIndex2++;
}
idealCount++;
}
if (actualCount == idealCount) {
array[arrayIndex] = oldArray[i];
System.out.println(oldArray[i]);
arrayIndex++;
}
idealCount++;
}
System.out.println();
return array;
}
System.out.println();
return array;
}
public static void print(Circle2D[] array)
{
@@ -272,7 +275,7 @@ public class Circle2D {
printPerimeter(circleArray);
Circle2D[] sortedArray = sortCirclesByPerimeter(circleArray);
printPerimeter(sortedArray);
print(circleArray);
print(circleArray);
Circle2D[] overlapArray = Circle2D.sortCirclesByNumberOfTimesOverlapping(circleArray);
print(overlapArray);