Merge branch 'manwar:master' into work

2 files changed, 54 insertions, 0 deletions

diff --git a/challenge-337/deadmarshal/java/Ch1.java b/challenge-337/deadmarshal/java/Ch1.java
new file mode 100644
index 0000000000..1ef262c742
--- /dev/null
+++ b/challenge-337/deadmarshal/java/Ch1.java
@@ -0,0 +1,29 @@
+import java.util.Arrays;
+
+public class Ch1 {
+  public static void main(String[] args) {
+    System.out.println(Arrays.toString(smaller_than_current(new int[]{6, 5, 4, 8})));
+    System.out.println(Arrays.toString(smaller_than_current(new int[]{7, 7, 7, 7})));
+    System.out.println(Arrays.toString(smaller_than_current(new int[]{5, 4, 3
+      , 2, 1})));
+    System.out.println(Arrays.toString(smaller_than_current(new int[]{-1, 0, 3, -2, 1})));
+    System.out.println(Arrays.toString(smaller_than_current(new int[]{0, 1, 1, 2, 0})));
+  }
+
+  private static int[] smaller_than_current(int[] nums) {
+    int[] arr = nums.clone();
+    Arrays.sort(arr);
+    for (int i = 0; i < nums.length; ++i) nums[i] = search(arr, nums[i]);
+    return nums;
+  }
+
+  private static int search(int[] nums, int x) {
+    int l = 0, r = nums.length;
+    while (l < r) {
+      int mid = (l + r) / 2;
+      if (nums[mid] >= x) r = mid;
+      else l = mid + 1;
+    }
+    return l;
+  }
+}
diff --git a/challenge-337/deadmarshal/java/Ch2.java b/challenge-337/deadmarshal/java/Ch2.java
new file mode 100644
index 0000000000..0d13408113
--- /dev/null
+++ b/challenge-337/deadmarshal/java/Ch2.java
@@ -0,0 +1,25 @@
+public class Ch2 {
+  public static void main(String[] args) {
+    System.out.println(odd_matrix(2, 3, new int[][]{{0, 1}, {1, 1}}));
+    System.out.println(odd_matrix(2, 2, new int[][]{{1, 1}, {0, 0}}));
+    System.out.println(odd_matrix(3, 3, new int[][]{{0, 0}, {1, 2}, {2, 1}}));
+    System.out.println(odd_matrix(1, 5, new int[][]{{0, 2}, {0, 4}}));
+    System.out.println(odd_matrix(4, 2, new int[][]{{1, 0}, {3, 1}, {2, 0}, {0, 1}}));
+  }
+
+  private static int odd_matrix(int row, int col, int[][] m) {
+    int res = 0;
+    int[][] g = new int[row][col];
+    for (int[] e : m) {
+      int r = e[0], c = e[1];
+      for (int i = 0; i < row; ++i) g[i][c]++;
+      for (int j = 0; j < col; ++j) g[r][j]++;
+    }
+    for (int[] rows : g) {
+      for (int v : rows) {
+        res += v % 2;
+      }
+    }
+    return res;
+  }
+}