Merge pull request #11562 from deadmarshal/TWC304

TWC304

2 files changed, 31 insertions, 0 deletions

diff --git a/challenge-304/deadmarshal/java/Ch1.java b/challenge-304/deadmarshal/java/Ch1.java
new file mode 100644
index 0000000000..2dc974388d
--- /dev/null
+++ b/challenge-304/deadmarshal/java/Ch1.java
@@ -0,0 +1,14 @@
+public class Ch1 {
+  public static void main(String[] args) {
+    System.out.println(arrange_binary(new int[]{1, 0, 0, 0, 1}, 1));
+    System.out.println(arrange_binary(new int[]{1, 0, 0, 0, 1}, 2));
+  }
+
+  private static boolean arrange_binary(int[] nums, int n) {
+    int c = 0;
+    for (int i = 0; i < nums.length - 1; ++i)
+      if (nums[i] == 0 && nums[i + 1] == 0) c++;
+    return c > n;
+  }
+}
+
diff --git a/challenge-304/deadmarshal/java/Ch2.java b/challenge-304/deadmarshal/java/Ch2.java
new file mode 100644
index 0000000000..4e28cacb96
--- /dev/null
+++ b/challenge-304/deadmarshal/java/Ch2.java
@@ -0,0 +1,17 @@
+public class Ch2 {
+  public static void main(String[] args) {
+    System.out.println(maximum_average(new int[]{1, 12, -5, -6, 50, 3}, 4));
+    System.out.println(maximum_average(new int[]{5}, 1));
+  }
+
+  private static double maximum_average(int[] nums, int n) {
+    double max = 0, avg;
+    for (int start = 0; start <= nums.length - n; ++start) {
+      double subsum = 0;
+      for (int i = start; i < start + n; ++i) subsum += nums[i];
+      avg = subsum / n;
+      if (avg > max) max = avg;
+    }
+    return max;
+  }
+}