Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
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
1 change: 1 addition & 0 deletions .gitignore
Original file line number Diff line number Diff line change
@@ -1,3 +1,4 @@
.idea/*
*.skill
*.iml
target/*
2 changes: 1 addition & 1 deletion pom.xml
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@
<version>1.0-SNAPSHOT</version>

<properties>
<jdk.version>11</jdk.version>
<jdk.version>17</jdk.version>
<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
<project.reporting.outputEncoding>UTF-8</project.reporting.outputEncoding>
<maven.checkstyle.plugin.version>3.1.1</maven.checkstyle.plugin.version>
Expand Down
16 changes: 14 additions & 2 deletions src/main/java/core/basesyntax/MyTask.java
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,7 @@
import java.util.concurrent.RecursiveTask;

public class MyTask extends RecursiveTask<Long> {
public static final int MAX = 10;
private int startPoint;
private int finishPoint;

Expand All @@ -13,7 +14,18 @@ public MyTask(int startPoint, int finishPoint) {

@Override
protected Long compute() {
// write your code here
return null;
int length = finishPoint - startPoint; // Это и есть ваш workLoad
if (length <= MAX) {
long sum = 0;
for (int i = startPoint; i < finishPoint; i++) {
sum += i;
}
return sum;
}
int middle = startPoint + (finishPoint - startPoint) / 2;
MyTask leftTask = new MyTask(startPoint, middle);
MyTask rightTask = new MyTask(middle, finishPoint);
leftTask.fork(); // Запускаем одну задачу асинхронно
return rightTask.compute() + leftTask.join();
}
}
Loading