MaxProfit

src/main/java/codility/p09_maximum_slice_problem/MaxProfit.java

@@ -0,0 +1,19 @@
+package codility.p09_maximum_slice_problem;
+
+/*
+https://app.codility.com/programmers/lessons/9-maximum_slice_problem/max_profit/
+ */
+public class MaxProfit {
+
+  // https://app.codility.com/demo/results/trainingYJVWX2-A6J/
+  public int solution(int[] A) {
+    int maxSlice = 0;
+    int max = 0;
+    for (int i = 1; i < A.length; i++) {
+      max = Math.max(max + A[i] - A[i - 1], 0);
+      maxSlice = Math.max(max, maxSlice);
+    }
+
+    return maxSlice;
+  }
+}

src/test/java/codility/p09_maximum_slice_problem/MaxProfitTest.java

@@ -0,0 +1,21 @@
+package codility.p09_maximum_slice_problem;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class MaxProfitTest {
+  MaxProfit maxProfit;
+
+  @BeforeEach
+  public void init() {
+    maxProfit = new MaxProfit();
+  }
+
+  @Test
+  public void sample1() {
+    int solution = maxProfit.solution(new int[]{23171, 21011, 21123, 21366, 21013, 21367});
+    assertThat(solution).isEqualTo(356);
+  }
+}