Skip to content

7 #8

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
PawelAbleneo wants to merge 2 commits into
base: main
Choose a base branch
from
Open

7 #8

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0a67d8e
7
PawelAbleneo Oct 19, 2023
c7217df
Merge branch 'main' into 7
ktor Oct 27, 2023
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
26 changes: 12 additions & 14 deletions src/main/java/sk/ableneo/openslava2023/codefix/BalloonChallenge.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,26 +6,24 @@

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

// TODO: fix the class
public class BalloonChallenge {

public LinkedList findOrdersForProduct(Product p, boolean debug) {
ArrayList l = new ArrayList();
ArrayList list = getAllOrders();
for (int i = 0; i < list.size(); i++) {
Order order = (Order) list.get(i);
boolean found = false;
if (order.getProducts().size() > 0) {
for (int j = 0; j <= order.getProducts().size(); j++) {
Product p2 = (Product) order.getProducts().get(j);
found = (p2 == p);
}
if (found && order != null)
l.add(order);
}
ArrayList results = new ArrayList();
ArrayList allOrders = getAllOrders();

for (int i = 0; i < allOrders.size(); i++) {
Order order = (Order) allOrders.get(i);
boolean found = order.getProducts().contains(p);

if (found)
results.add(order);
}
return new LinkedList(l);

return new LinkedList(results);
}

public ArrayList getAllOrders() {
Expand Down